Undecidable Problems About CFLs
Part of the Undergraduate Texts in Computer Science book series (UTCS)
In this lecture we show that a very simple problem about CFLs is undecidable, namely the problem of deciding whether a given CFG generates all strings.
KeywordsTuring Machine Finite Automaton Short String Start Symbol Tape Head
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 1997