Data-Structures
October 6, 2023Theory-of-Computation
October 6, 2023Theory-of-Computation
| Question 2 |
Which one of the following statements is FALSE?
| There exist context-free languages such that all the context-free grammars generating them are ambiguous | |
| An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it | |
| Both deterministic and non-deterministic pushdown automata always accept the same set of languages | |
| A finite set of string from one alphabet is always a regular language |
Question 2 Explanation:
Deterministic automata can be able to recognize all the deterministic context-free languages.
But non-deterministic ones can recognize all context-free languages.
So, option C is false.
But non-deterministic ones can recognize all context-free languages.
So, option C is false.
Correct Answer: C
Question 2 Explanation:
Deterministic automata can be able to recognize all the deterministic context-free languages.
But non-deterministic ones can recognize all context-free languages.
So, option C is false.
But non-deterministic ones can recognize all context-free languages.
So, option C is false.
Subscribe
Login
0 Comments