Superlinear deterministic top-down tree transducers
From MaRDI portal
Publication:4895817
DOI10.1007/BF01184813zbMath0857.68068OpenAlexW1978316224MaRDI QIDQ4895817
Publication date: 3 March 1997
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01184813
Related Items
Compositions with superlinear deterministic top-down tree transformations ⋮ Decidability of the finiteness of ranges of tree transductions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bottom-up and top-down tree transformations— a comparison
- Composition of top-down and bottom-up tree transductions
- Three hierarchies of transducers
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Mappings and grammars on trees