Tree-stack automata

DOI10.1007/BF01201277MaRDI QIDQ4879207zbMATH OpenOpenAlexFDO

Authors Wolfgang Golubski, Wolfram-M. Lippe

Publication date 27 May 1996

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01201277

zbMATH Keywords

stack automatatree-stack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4213435
• scientific article; zbMATH DE number 3885333
• Tree pushdown automata
• Deciding emptiness for stack automata on infinite trees
• Linear weighted tree automata with storage and inverse linear tree homomorphisms

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3738941 (Why is no real title available?)
• scientific article; zbMATH DE number 3548455 (Why is no real title available?)
• A Grammatical Characterization of One-Way Nondeterministic Stack Languages
• Checking automata and one-way stack languages
• High level tree transducers and iterated pushdown tree transducers
• Intercalation theorems for stack languages
• Iterated stack automata and complexity classes
• Mappings and grammars on trees
• Nested Stack Automata
• On correct procedure parameter transmission in higher programming languages
• On procedures as open subroutines. II
• One-way stack automata
• Pushdown machines for the macro tree transducer
• Pushdown tree automata
• Regular canonical systems
• Stack Machines and Classes of Nonnested Macro Languages
• Stack automata and compiling
• The IO- and OI-hierarchies
• Tree generating regular systems
• Tree transducers, L systems, and two-way machines
• Two-way nested stack automata are equivalent to two-way stack automata

Cited in

(14)

• Branching Pushdown Tree Automata
• Nested Sibling Tree Automata
• scientific article; zbMATH DE number 3885333 (Why is no real title available?)
• Tree Automata with Memory, Visibility and Structural Constraints
• Deterministic stack transducers
• Iterated stack automata and complexity classes
• Tree-walking-storage automata
• Visit-bounded stack automata
• Visit-bounded stack automata
• Deterministic stack transducers
• Tree pushdown automata
• Symbolic tree automata
• Rigid Tree Automata
• Two-way automata with more than one storage medium

This page was built for publication: Tree-stack automata

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