Stack Machines and Classes of Nonnested Macro Languages

DOI10.1145/322169.322178MaRDI QIDQ3865515zbMATH OpenOpenAlexFDO

Authors J. Van Leeuwen, Joost Engelfriet, Erik Meineche Schmidt

Publication date 1980

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/stack-machines-and-classes-of-nonnested-macro-languages(142d5c62-d912-44f6-8feb-d314d2d552ce).html

zbMATH Keywords

ETOL languagesintermittent parameter evaluationmacro expansionmacro grammarsnonnested macro languagesone-way stack automatapushdown storestack languagestopdown tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(15)

• Hierarchies of hyper-AFLs
• Extended macro grammars and stack controlled machines
• Tree transducers, L systems, and two-way machines
• Iterated stack automata and complexity classes
• One way finite visit automata
• Extended linear macro grammars, iteration grammars, and register programs
• The power of two-way deterministic checking stack automata
• Principal abstract families of weighted tree languages
• scientific article; zbMATH DE number 3776895 (Why is no real title available?)
• Applications of L systems to group theory
• Three hierarchies of transducers
• Tree-stack automata
• The generative capacity of block-synchronized context-free grammars
• Basic tree transducers
• On groups with EDT0L word problem

This page was built for publication: Stack Machines and Classes of Nonnested Macro Languages

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