Equational tree transformations
From MaRDI portal
Publication:551198
DOI10.1016/j.tcs.2011.03.028zbMath1216.68153OpenAlexW2016461613MaRDI QIDQ551198
Symeon Bozapalidis, Zoltán Fülöp, George Rahonis
Publication date: 14 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.028
tree transformationsbimorphismsequational semanticsIO- and OI-tree substitutionsrecognizable tree languages
Related Items (3)
From Tree Automata to Rational Tree Expressions ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Equational weighted tree transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basic notions of universal algebra for language theory and graph grammars
- Defining syntax-directed translations by tree bimorphisms
- Compositions of extended top-down tree transducers
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Recognizable formal power series on trees
- Morphismes et bimorphismes d'arbres
- Alphabetic tree relations
- IO and OI. I
- Equational elements in additive algebras
- Derivation trees of ground term rewriting systems.
- Optimization of LR(k) parsers
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
- The Power of Extended Top-Down Tree Transducers
- PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Algebraic automata and context-free sets
This page was built for publication: Equational tree transformations