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.
Decidability of does this CFG define a regular language
reference request;fl.formal languages
By Wikipedia it is undecidable.