in Theory of Computation
394 views
0 votes
0 votes
can we say that every regular language is a DCFL?
in Theory of Computation
394 views

4 Comments

Why Not???

Give any example Which is Regular But not DCFL.
0
0
Oh! I interpreted in a reverse way!
0
0
Me too, But for this type Question remember Hierarchy.
2
2

Please log in or register to answer this question.

Related questions