2022 | OriginalPaper | Buchkapitel
Supplementary Topics
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
In this last chapter we consider some more classes of machines and languages, besides those we have studied in the previous chapters. We also present some additional properties of finite automata, regular grammars, context-free grammars, and the so called abstract classes of languages. Finally, we present the Bernstein Theorem and we prove the existence of functions that are not computable.