Decidability of operation problems for T0L languages and subclasses

DOI10.1016/J.IC.2010.11.008zbMATH Open1217.68124OpenAlexW1998380256MaRDI QIDQ553300FDOQ553300

Authors: Henning Bordihn, Markus Holzer, 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

Recommendations

• Undecidability of Operation Problems for T0L Languages and Subclasses
• On the union of 0L languages
• On decidability and closure properties of language classes with respect to bio-operations
• scientific article; zbMATH DE number 871232
• scientific article; zbMATH DE number 1501610

zbMATH Keywords

decidabilityunary languagesL systemsoperation problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• A variant of a recursively unsolvable problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• On the union of 0L languages

Cited In (5)

• UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
• Implementation and Application of Automata
• On decidability and closure properties of language classes with respect to bio-operations
• Undecidability of Operation Problems for T0L Languages and Subclasses
• Recurrent words and simultaneous growth in T0L systems

This page was built for publication: Decidability 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 Q553300)