Languages, Decidability, and Complexity

DOI10.1007/978-1-4471-4276-8_2zbMath1304.68104OpenAlexW179523850MaRDI QIDQ5496920

Stefan Haar, Tomáš Masopust

Publication date: 29 January 2015

Published in: Lecture Notes in Control and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4471-4276-8_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)

Cites Work

• Turing machines with sublogarithmic space
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
• A Second Course in Formal Languages and Automata Theory
• The classical decision problem.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Languages, Decidability, and Complexity