Basic tree transducers
From MaRDI portal
Publication:579951
DOI10.1016/0022-0000(87)90007-9zbMath0625.68061OpenAlexW2069933339MaRDI QIDQ579951
Publication date: 1987
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(87)90007-9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Look-ahead on pushdowns
- Linear indexed languages
- Extended macro grammars and stack controlled machines
- Macro tree transducers
- Pushdown machines for the macro tree transducer
- Tree transducers, L systems, and two-way machines
- A representation of trees by languages. II
- The IO- and OI-hierarchies
- Attribute grammars and recursive program schemes. I. II
- A geometric hierarchy of languages
- Control sets on context-free grammar forms
- One way finite visit automata
- IO and OI. II
- Checking automata and one-way stack languages
- Generalized sequential machine maps
- Pushdown tree automata
- On the equivalence problem for attribute systems
- An automata-theoretical characterization of the OI-hierarchy
- Stack Machines and Classes of Nonnested Macro Languages
- Bounded nesting in macro grammars
- Extension of tabled 0L-systems and languages
- Control sets on linear grammars
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Three hierarchies of transducers
- Finite-Turn Pushdown Automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Control sets on grammars
- Indexed Grammars—An Extension of Context-Free Grammars
- Nested Stack Automata
- Full AFLs and nested iterated substitution
- Mappings and grammars on trees
This page was built for publication: Basic tree transducers
