in Theory of Computation
112 views
0 votes
0 votes
Show that $L =$ {$w ∈$ {$a, b$}$^* : n_a (w) ≠ n_b (w)$} is a deterministic context-free language.
in Theory of Computation
112 views

Please log in or register to answer this question.

Related questions