Some restrictions onW-grammars

DOI10.1007/BF00978977MaRDI QIDQ4776853zbMATH OpenFDO

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

• scientific article; zbMATH DE number 3254900 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3383521 (Why is no real title available?)
• A note on enumerable grammars
• An infinite hierarchy of intersections of context-free languages
• Indexed Grammars—An Extension of Context-Free Grammars
• Linear Automaton Transformations
• Nested Stack Automata
• On 0L-Languages
• One-way stack automata
• Property grammars and table machines
• Quasi-realtime languages
• Time-bounded grammars and their languages
• Two Families of Languages Related to ALGOL

Cited in

(4)

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

Describes a project that uses

Uses Software

• ALGOL 60
• ALGOL 68

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)