Leftist Grammars Are Non-primitive Recursive

DOI10.1007/978-3-540-70583-3_5zbMath1155.68411OpenAlexW1523026950MaRDI QIDQ3520303

Tomasz Jurdziński

Publication date: 19 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Leftist Grammars Are Non-primitive Recursive ⋮ Rational subsets and submonoids of wreath products.

Cites Work

• Verifying lossy channel systems has nonprimitive recursive complexity.
• On complexity of grammars related to the safety problem
• Leftist grammars and the Chomsky hierarchy
• Leftist Grammars Are Non-primitive Recursive
• Protection in operating systems
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Leftist Grammars Are Non-primitive Recursive