Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata

Which of the following is/are correct?

I. A language is context free if and only if it is accepted by PDA

II. PDA is a finite automata with push down stack

1
Both I and II are true
2
Both I and II are false
3
Only II is true
4
Only I is true

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters