in Theory of Computation
160 views
0 votes
0 votes
Is the language $L =$ {$a^nb^m : n = m$ or $n = m + 2$} deterministic?
in Theory of Computation
160 views

2 Comments

NO
0
0
Non deterministic CFL
0
0

Please log in or register to answer this question.

Related questions