Undecidability of Operation Problems for T0L Languages and Subclasses

DOI10.1007/978-3-642-00982-2_20zbMath1234.68199OpenAlexW1484685742MaRDI QIDQ3618583

Markus Holzer, Martin Kutrib, Henning Bordihn

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of 0L languages
• Pure grammars
• UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
• A variant of a recursively unsolvable problem

This page was built for publication: Undecidability of Operation Problems for T0L Languages and Subclasses