Question

Finite Automata (FA) and Push Down Automata (PDA) both are used to express the languages. The Finite Automata is deterministic and Push Down Automata is deterministic and as well as non-deterministic.

You are required to give comments on the following statements:

• Whether the PDA accepts all the languages that have been accepted by the FA? Yes or No, explain in either case with an example.

• Whether the FA accepts all the languages that have been accepted by the PDA? Yes or No, explain in either case with an example.

Answer 1

Answer:

yes it FAaccepts all the languages that have been accepted by the PDA