The generating power of total deterministic tree transducers
From MaRDI portal
Publication:1281500
DOI10.1006/inco.1998.2736zbMath0927.68046OpenAlexW1967200785MaRDI QIDQ1281500
Publication date: 19 December 1999
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0fc780cef919004d43310b8d6d3831cfd28c4bd9
Related Items (4)
Branching synchronization grammars with nested tables ⋮ Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition ⋮ Macro tree transducers, attribute grammars, and MSO definable tree translations. ⋮ Output string languages of compositions of deterministic macro tree transducers
Cites Work
- Hyperedge replacement: grammars and languages
- Increasing modularity and language-independency in automatically generated compilers
- Composition and evaluation of attribute coupled grammars
- Tree transducers, L systems, and two-way machines
- Attribute grammars and recursive program schemes. I. II
- The string generating power of context-free hypergraph grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Tree transducers with external functions
- Attribute grammars. Definitions, systems and bibliography
- Surface tree languages and parallel derivation trees
- On theories with a combinatorial definition of 'equivalence'
- Passes and paths of attribute grammars
- Handbook of Graph Grammars and Computing by Graph Transformation
- Three hierarchies of transducers
- A two-dimensional hierarchy for attributed tree transducers
- Semantics of context-free languages
- Mappings and grammars on trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The generating power of total deterministic tree transducers
