Solution : of GBD cs402

A finite state machine cannot identify or recognize Context free language at all. Push down

automata (PDA) and Turing machine both can identify/recognize Context free language but

a Turing machine can recognize context free language using few states or transition than a

push down automata for the same language.

Turing machine is more powerful, Turing machine with an input tape and a working tape can

emulate a pushdown automaton directly, using the same number of steps. Turing machines

can accept some non- Context free languages as well, in addition to Context free languages.