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.
Which of the following statements is true? Regular grammars and finite state automata describe a larger class of languag
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following statements is true? Regular grammars and finite state automata describe a larger class of languag
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!