2022 | OriginalPaper | Buchkapitel
Decidability and Undecidability in Context-Free Languages
verfasst von : Alberto Pettorossi
Erschienen in: Automata Theory and Formal Languages
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter is devoted to the study of the decidability and undecidability properties of (i) the context-free languages, (ii) the deterministic context-free languages, and (iii) the linear context-free languages. We also present the Post Theorem about recursively enumerable sets, the Turing Theorem on the Halting Problem, and the Greibach Theorem about the undecidability of a property for classes of languages.