Transductions of dags and trees
From MaRDI portal
Publication:4742320
DOI10.1007/BF01786981zbMath0505.68035MaRDI QIDQ4742320
Tsutomu Kamimura, Giora Slutzki
Publication date: 1982
Published in: Mathematical Systems Theory (Search for Journal in Brave)
tree languagesdirected acyclic graphstransductionsphrase-structure grammarsdag languagesbottom-up dag-to-tree transducers
Related Items
Graph automata, The ancestor width of grammars and languages, Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree transducers, L systems, and two-way machines
- Generalized sequential machine maps
- On the computational power of pushdown automata
- Semantic preserving translations
- On the syntactic structures of unrestricted grammars I. Generative grammars and phrase structure grammars
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
- Composition of top-down and bottom-up tree transductions
- Acceptors for the derivation languages of phrase-structure grammars
- Tree transducers, L systems and two-way machines (Extended Abstract)
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Mappings and grammars on trees
- Translations on a context free grammar
