Alphabetic and synchronized tree transducers
From MaRDI portal
Publication:5941078
DOI10.1016/S0304-3975(99)00296-0zbMath0974.68094MaRDI QIDQ5941078
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Synchronized rational relations of finite and infinite words
- Morphismes et bimorphismes d'arbres
- Alphabetic tree relations
- Un théorème de duplication pour les forets algébriques
- On two families of forests
- Synchronized tree automata
- Undecidable properties of deterministic top-down tree transducers
- Top-down tree transducers with deterministic top-down look-ahead
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- Tree transducers and tree languages
- Composition of top-down and bottom-up tree transductions
- Three hierarchies of transducers
- Mappings and grammars on trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Alphabetic and synchronized tree transducers
