engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata
Consider the following facts about D-PDA and N-PDA and count how many of them are FALSE.
- D-PDA is less powerful than N-PDA.
- It is possible to convert every N-PDA to D-PDA.
- Language accepted by D-PDA is superset of language accepted by N-PDA.
- For every state in D-PDA, there exist only one move from that state to any other state.
- N-PDA has infinite stack whereas D-PDA doesn't.
Enter numerical value using the virtual keypad. Round off where necessary.