Some restrictions onW-grammars

DOI10.1007/BF00978977zbMath0288.68035MaRDI QIDQ4776853

Sheila A. Greibach

Publication date: 1974

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On parsing two-level grammars ⋮ Parallelism and synchronization in two-level metacontrolled substitution grammars ⋮ Languages with homomorphic replacements ⋮ On the complexity of formal grammars

Uses Software

• ALGOL 68
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Time-bounded grammars and their languages
• Linear Automaton Transformations
• One-way stack automata
• Indexed Grammars—An Extension of Context-Free Grammars
• A note on enumerable grammars
• Property grammars and table machines
• Nested Stack Automata
• Quasi-realtime languages
• Two Families of Languages Related to ALGOL
• On 0L-Languages
• An infinite hierarchy of intersections of context-free languages

This page was built for publication: Some restrictions onW-grammars