Equational tree transformations

DOI10.1016/J.TCS.2011.03.028MaRDI QIDQ551198zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

bimorphismsequational semanticsIO- and OI-tree substitutionsrecognizable tree languagestree transformations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• Equational weighted tree transformations
• Alphabetic and synchronized tree transducers
• Alphabetic tree relations
• Recursively defined tree transductions
• Publication:4723319

Cites work

• scientific article; zbMATH DE number 5141496 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 51770 (Why is no real title available?)
• scientific article; zbMATH DE number 3566209 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 475424 (Why is no real title available?)
• Algebraic automata and context-free sets
• Alphabetic tree relations
• Basic notions of universal algebra for language theory and graph grammars
• Bottom-up and top-down tree transformations— a comparison
• Compositions of extended top-down tree transducers
• Defining syntax-directed translations by tree bimorphisms
• Derivation trees of ground term rewriting systems.
• Equational elements in additive algebras
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• IO and OI. I
• Morphismes et bimorphismes d'arbres
• Optimization of LR(k) parsers
• Properties of quasi-relabeling tree bimorphisms
• Recognizable formal power series on trees
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
• Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
• The Power of Extended Top-Down Tree Transducers
• Top-down tree transducers with regular look-ahead

Cited in

(9)

• From tree automata to rational tree expressions
• Algebras of left variable terms
• Equational weighted tree transformations with discounting
• Equational weighted tree transformations
• The partial clone of completely expanded terms
• Alphabetic tree relations
• Recursively defined tree transductions
• Tree-Series-to-Tree-Series Transformations
• Algebras of generalized tree languages with fixed variables

This page was built for publication: Equational tree transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551198)