Consider the following pushdown automaton pda


Problem:

Consider the following Pushdown Automaton (PDA) P1:

P1 = (Q = {q0, q1}, ∑ = {a, b, c}, ×" = {0, 1, #}, δ, q0, Z0 = #, F = {q1}) where the transition function δ is given by:
δ (q0, a,#) = {(q0, 0#), (q0, 11#)}
δ (q0, a, 0) = {(q0, 00), (q0, 110)}
δ (q0, a, 1) = {(q0, 01), (q0, 111)}
δ (q0, b, 0) = {(q0, Î)}
δ (q0, c, 1) = {(q0, Î)}
δ (q0, Î,#) = {(q1,#)}

Acceptance is by final state.

Which of the following words are accepted by the PDA P1? Show the processes.

a. ab
b. aababcc 
c. ac

Additional Information:

The question is from Computer Science and it explains about the processes that take place in the Pushdown Automation P1.

Total Word Limit: 121 Words

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: Consider the following pushdown automaton pda
Reference No:- TGS01109599

Now Priced at $5 (50% Discount)

Recommended (97%)

Rated (4.9/5)