On the structure of context-sensitive grammars

DOI10.1007/BF00976059zbMath0266.68038DBLPjournals/ijpp/Book73OpenAlexW2045716123WikidataQ56562957 ScholiaQ56562957MaRDI QIDQ5683718

Ronald V. Book

Publication date: 1973

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Membership for growing context-sensitive grammars is polynomial ⋮ On the complexity of formal grammars ⋮ Classes of formal grammars ⋮ On growing context-sensitive languages ⋮ The ancestor width of grammars and languages ⋮ Normal forms for context-sensitive grammars ⋮ On permutative grammars generating context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• A generator of context-sensitive languages
• Time-bounded grammars and their languages
• A Grammatical Characterization of One-Way Nondeterministic Stack Languages
• A note on asymmetry in phrase structure grammars
• Mappings which preserve context sensitive languages
• Two-way languages
• Some remarks on derivations in general rewriting systems
• Indexed Grammars—An Extension of Context-Free Grammars
• Programmed Grammars and Classes of Formal Languages
• Studies in abstract families of languages
• Classes of languages and linear-bounded automata
• Syntax and semantics: A categorical view
• Terminal Context in Context-Sensitive Grammars

This page was built for publication: On the structure of context-sensitive grammars