1.

The language accepted by the nondeterministic pushdown automatonM= ({q0, q1, q2}, {a, b}, {a, b, z}, d, q0, z, {q2}) with transitionsd (q0 a, z) = { (q1 a), (q2 ?)};d (q1, b, a) = { (q1, b)}d (q1, b, b) ={ (q1 b)}, d (q1, a, b) = { (q2, ?)} is

A. L(abb*a)
B. {a} U L(abb*a)
C. L(ab*a)
D. {a} U L(ab*a)
Answer» C. L(ab*a)


Discussion

No Comment Found

Related MCQs