Some restrictions onW-grammars

DOI10.1007/BF00978977zbMATH Open0288.68035MaRDI QIDQ4776853FDOQ4776853

Authors: 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)

Cites Work

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

Cited In (4)

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

Uses Software

• ALGOL 68
• ALGOL 60

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

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