Here are the transitions of a deterministic pushdown automaton. The start state is 90, and f...

Question

Question

Answer 1

Answer #1

Answer: bababb

(q0, Z0, bababb) -> (q2, Bz0), Stack: B,Z0

(q2, B, ababb) -> (q3, ε) , Stack Z0

(q3, Z0, babb) -> (q1, AZ0) , Stack : A, Z0

(q1, A, babb) -> (q1, ε) , Stack: Z0

(q1, Z0, abb) -> (q0, Z0) , Stack : Z0

(q0, z0, abb) -> (q1, AAZ0) , Stack: A, A, Z0

(q1, A, bb) -> (q1, ε), Stack: A, Z0

(q1, A, b) -> (q1, ε) , Stack: Z0

(q1, Z0, ε) -> (q0, Z0) , stack: Z0

(q0, Z0, ε) -> (f, ε), Stack : empty

Reached final state f from initial state q0.

Answer 2

Similar Homework Help Questions

Please Help with this questions with short explanation thank you :) Consider the pushdown automaton with...

Please Help with this questions with short explanation thank you :) Consider the pushdown automaton with the following transition rules: 1.8(0,0,20) = {(q,XZ0)} 2. 8(9,0,X) = {(q,XX)} 3. 8(q,1,X) = {(q,x)} 4. 8(q,£,X) = {(p,ɛ)} 5. 8(p,£,X) = {(p,ɛ)} 6.8(p,1,X) = {(p,XX)} 7. 8(p,1,20) = {(p,ɛ)} From the ID (p,1101,XXZ0), which of the following ID's can NOT be reached? (p,101,XZO) (p,101,XXXZO) (2,01,XXXXXZO) O (p,01,8) Here are the transitions of a deterministic pushdown automaton. The start state is qo, and f...
QUESTION 3 Here is a nondeterministic finite automaton with epsilon-transitions. 1 1 Start €,0 0 €...

QUESTION 3 Here is a nondeterministic finite automaton with epsilon-transitions. 1 1 Start €,0 0 € 90 91 92 93 95 94 Which of the following strings is NOT accepted? 10101 01110 01111 11110 The following nondeterministic finite automaton: 1 0 А B 0 1 accepts which of the following strings? 1001011 0111011 0101010 1010101