Undecidability of Operation Problems for T0L Languages and Subclasses

DOI10.1007/978-3-642-00982-2_20MaRDI QIDQ3618583zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Decidability of operation problems for T0L languages and subclasses
• scientific article; zbMATH DE number 871232
• scientific article; zbMATH DE number 1501610
• On the union of 0L languages
• Implementation and Application of Automata

Cites work

• A variant of a recursively unsolvable problem
• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On the union of 0L languages
• Pure grammars
• UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES

Cited in

(5)

• Recurrent words and simultaneous growth in T0L systems
• TSO-to-TSO linearizability is undecidable
• UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
• Implementation and Application of Automata
• Decidability of operation problems for T0L languages and subclasses

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618583)