Tree-stack automata
From MaRDI portal
Publication:4879207
DOI10.1007/BF01201277zbMATH Open0846.68073OpenAlexW2046505442MaRDI QIDQ4879207FDOQ4879207
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
Recommendations
Cites Work
- Title not available (Why is that?)
- The IO- and OI-hierarchies
- Iterated stack automata and complexity classes
- Nested Stack Automata
- Mappings and grammars on trees
- Stack automata and compiling
- Tree generating regular systems
- Tree transducers, L systems, and two-way machines
- One-way stack automata
- High level tree transducers and iterated pushdown tree transducers
- Pushdown tree automata
- Stack Machines and Classes of Nonnested Macro Languages
- Pushdown machines for the macro tree transducer
- Checking automata and one-way stack languages
- Regular canonical systems
- Intercalation theorems for stack languages
- On procedures as open subroutines. II
- On correct procedure parameter transmission in higher programming languages
- Title not available (Why is that?)
- Two-way nested stack automata are equivalent to two-way stack automata
- A Grammatical Characterization of One-Way Nondeterministic Stack Languages
- Title not available (Why is that?)
Cited In (14)
- Branching Pushdown Tree Automata
- Nested Sibling Tree Automata
- Title not available (Why is that?)
- Tree Automata with Memory, Visibility and Structural Constraints
- Deterministic stack transducers
- Tree-walking-storage automata
- Iterated stack automata and complexity classes
- 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)
