Question 9991 – Theory-of-Computation
December 6, 2023
Question 10026 – Theory-of-Computation
December 6, 2023
Question 9991 – Theory-of-Computation
December 6, 2023
Question 10026 – Theory-of-Computation
December 6, 2023

Question 10017 – Theory-of-Computation

Let M = ({q0, q1}, {0, 1}, {z0, x}, δ, q0, z0, ∅) be a pushdown automaton where δ is given by

    δ(q0, 1, z0) = {(q0, xz0)}
    δ(q0, ε, z0) = {(q0, ε)}
    δ(q0, 1, X) = {(q0, XX)}
    δ(q1, 1, X) = {(q1, ε)}
    δ(q0, 0, X) = {(q1, X)}
    δ(q0, 0, z0) = {(q0, z0)}

(a) What is the language accepted by this PDA by empty stack?

(b) Describe informally the working of the PDA.

Correct Answer: A

A
Theory Explanation.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!