in Theory of Computation edited by
226 views
0 votes
0 votes
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable?

The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable .

 

Help would be appreciated.
in Theory of Computation edited by
226 views

1 comment

undecidable
1
1

Please log in or register to answer this question.

Related questions