Full AFLs and nested iterated substitution
- 31 March 1970
- journal article
- Published by Elsevier in Information and Control
- Vol. 16 (1) , 7-35
- https://doi.org/10.1016/s0019-9958(70)80039-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Nested Stack AutomataJournal of the ACM, 1969
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- Indexed Grammars—An Extension of Context-Free GrammarsJournal of the ACM, 1968
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- Decidable and Undecidable Questions About AutomataJournal of the ACM, 1968
- A note on undecidable properties of formal languagesTheory of Computing Systems, 1968
- Inclusion relations among families of context-free languagesInformation and Control, 1967
- One-way stack automataJournal of the ACM, 1967