On weak growing context-sensitive grammars

DOI10.1007/3-540-59175-3_88zbMath1495.68110OpenAlexW1550656372MaRDI QIDQ5096331

Gerhard Buntrock, Gundula Niemann

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_88

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Membership for growing context-sensitive grammars is polynomial
• Tree-size bounded alternation
• On the complexity of formal grammars
• Normal forms for context-sensitive grammars
• On certain formal properties of grammars
• On the Tape Complexity of Deterministic Context-Free Languages
• On growing context-sensitive languages
• Studies in abstract families of languages
• Classes of languages and linear-bounded automata
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: On weak growing context-sensitive grammars