Question

1. For any push down automata there exists another push down automata that accepts the same language but contains only one POP state
2. For every regular language, there exists a push down automata.\
3. The regular language does not contain a stack

Which of the above statements are true?
a) 1 & 3
b) 1 & 2
c) 2 & 3
d) All the 3 statements are true

Answer 1

Answer:

b

Explanation:

it's called maths kids learn maths

Answer 2

Answer:

hiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii