in Theory of Computation
204 views
0 votes
0 votes
Is the language $L =$ {$a^nb^n : n ≥ 1$} $∪$ {$a$} deterministic?
in Theory of Computation
204 views

1 comment

yes
0
0

1 Answer

0 votes
0 votes
DCFL is closed under union with Regular language.

Related questions