Decidability of operation problems for T0L languages and subclasses

DOI10.1016/j.ic.2010.11.008zbMath1217.68124OpenAlexW1998380256MaRDI QIDQ553300

Markus Holzer, Henning Bordihn, Martin Kutrib

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.008

zbMATH Keywords

decidabilityunary languagesL systemsoperation problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of 0L languages
• Characterization of unary developmental languages
• Solution of a decision problem concerning unary Lindenmayer systems
• 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: Decidability of operation problems for T0L languages and subclasses