Question

Consider the following statements.
I) For any push down automata there exists another push down automata that accepts
same language but contains only one POP state.
II) For every regular language, there exists a push down automata.
III) The regular language does not contain a stack.
Which of the above statements is/are true?
a) I and III
b) I and II
c) II and III
d) All the three statements are true.​

Answer 1

Answer:

b) l and ll....are true

......

....

.........

Answer 2

Explanation:

b) I and II is true ..... okay all the best