Is the decidablity of the following question known?

Given a CFG G, is L(G) regular?

I've seen a bunch of decidability results in the world of CFLs, but I don't think I've ever seen this one, and can't find anything about it.

  • 3
    $\begingroup$ See Hopcroft and Ullman, 1979, page 281. $\endgroup$ – Kaveh Feb 2 '12 at 23:33

By Wikipedia it is undecidable.

  • $\begingroup$ Fair enough; I guess I only looked at the page for CFLs and not CFGs. Still, the page you cite doesn't give any references for that claim, and even a more directed search in Sipser (using the sections in the "further reading" citations and a better index term) doesn't yield anything. Closest it has is "does this TM define a regular language", which falls right out of Rice's thm. $\endgroup$ – EvanED Feb 2 '12 at 19:14
  • 9
    $\begingroup$ It's a consequence of Greibach's Theorem, see last pages here: cis.upenn.edu/~jean/gbooks/PCPh04.pdf $\endgroup$ – Shir Feb 2 '12 at 19:37
  • 2
    $\begingroup$ I found a reference to include in the Wikipedia article. (The source Shir posted looks better than the one I found, in the sense that it justifies the claim of undecidability rather than just stating it, but unfortunately it doesn't seem to be published yet.) $\endgroup$ – David Eppstein Feb 2 '12 at 21:34
  • 1
    $\begingroup$ If the alphabet is unary it is decidable. ;) $\endgroup$ – Zach Langley Feb 2 '12 at 22:59
  • $\begingroup$ @David, see my comment below the question for a published reference. $\endgroup$ – Kaveh Feb 2 '12 at 23:35

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.