in Theory of Computation edited by
337 views
1 vote
1 vote
Find a pda with fewer than four states that accepts the language $L=${$a^nb^n:n\geq 0$} $\cup$ {$a$}.
in Theory of Computation edited by
337 views

Please log in or register to answer this question.

Related questions