On Complexity of Grammars Related to the Safety Problem

DOI10.1007/11787006_37MaRDI QIDQ3591430zbMATH OpenOpenAlexFDO

Authors Tomasz Jurdziński

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_37

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42)

Recommendations

• On complexity of grammars related to the safety problem
• Leftist grammars and the Chomsky hierarchy
• Leftist Grammars Are Non-primitive Recursive
• Fundamentals of Computation Theory
• Safety in grammatical protection systems

Cited in

(8)

• On complexity of grammars related to the safety problem
• Leftist grammars and the Chomsky hierarchy
• On the decidability of accessibility problems (extended abstract)
• Safety in grammatical protection systems
• Leftist Grammars Are Non-primitive Recursive
• Toward a compositional theory of leftist grammars and transformations
• Fundamentals of Computation Theory
• Automata, Languages and Programming

This page was built for publication: On Complexity of Grammars Related to the Safety Problem

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