The language of the following PDA would be:
δ(q0, a, z0) = (q0, aaaz0)
δ(q0, a, a) = (q0, aaaa)
δ(q0, b, a) = (q1, λ)
δ(q1, b, a) = (q1, λ)
δ(q1, ε, z0) = (qf, z0), where qf is the final state.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. {aⁿb³ⁿ | n > 0}
Explanation
Each a pushes three a's onto the stack, and each b pops one. Acceptance requires the stack to return to z0, so #b = 3·#a.More Theory of Computation and Compilers questions
- For the given two machines over {a, b}, which of the following is correct? Machine 1: states A (start), B (final); A –a→ A, A –a→ B, B –b→…
- The number of tokens in the line ' for i in range (begin; end ; step) : ' is:
- In the pumping lemma for context-free languages, for a string uvwxy, what is the minimum length of vx together?
- Which of the following is an ε-free grammar?
- While processing a string, an LR parser reads the input
- What are the minimum and maximum numbers of initial, dead, unreachable and final states in a valid n-state finite automaton whose accepted…