Extended macro grammars and stack controlled machines
From MaRDI portal
Publication:1064075
DOI10.1016/0022-0000(84)90006-0zbMath0575.68081OpenAlexW2039623570MaRDI QIDQ1064075
Joost Engelfriet, Giora Slutzki
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/extended-macro-grammars-and-stack-controlled-machines(3d03e202-f82c-4f1b-ab54-6cf530a14548).html
closure propertiesinfinite hierarchymachine characterizationbasic substitutiondepth of nesting of stacksextended basic macro grammarsfull AFLsnested stack automata
Related Items
Pushdown machines for the macro tree transducer, Tree transducers, L systems, and two-way machines, Iterated stack automata and complexity classes, An implementation of syntax directed functional programming on nested- stack machines, Pushdown tree automata, Iterated pushdown automata and sequences of rational numbers, Basic tree transducers, The power of two-way deterministic checking stack automata, Hierarchies of hyper-AFLs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hierarchies of hyper-AFLs
- A relationship between ETOL and EDTOL languages
- IO and OI. II
- Extended linear macro grammars, iteration grammars, and register programs
- L systems
- Some definitional suggestions for automata theory
- Checking automata and one-way stack languages
- Stack Machines and Classes of Nonnested Macro Languages
- Bounded nesting in macro grammars
- Controlled iteration grammars and full hyper-AFL's
- On acceptors of iteration languages
- An Approach to a Unified Theory of Automata
- Programming Language for Automata
- One-way stack automata
- Indexed Grammars—An Extension of Context-Free Grammars
- Nested Stack Automata
- Full AFLs and nested iterated substitution
- Chains of full AFL's
