Which of the following statements is true? Regular grammars and finite state automata describe a larger class of languag
Posted: Thu Jul 14, 2022 2:06 pm
Which of the following statementsis true?
Regular grammars and finite state automata describe a largerclass of languages than regular expressions
Finite state automata describe a larger class of languages thancontext free grammars
Regular grammars can describe infinite languages
There are finite languages that context free grammars cannotrecognise.
Regular grammars and finite state automata describe a largerclass of languages than regular expressions
Finite state automata describe a larger class of languages thancontext free grammars
Regular grammars can describe infinite languages
There are finite languages that context free grammars cannotrecognise.