Equational weighted tree transformations

DOI10.1007/s00236-011-0148-5zbMath1244.68054OpenAlexW1990698263MaRDI QIDQ766185

George Rahonis, Symeon Bozapalidis, Zoltán Fülöp

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-011-0148-5

zbMATH Keywords

tree languagestree transducersMezei-Wright theoremstree bimorphismsweighted equational setsweighted tree transformations

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Cites Work

• Equational tree transformations
• Basic notions of universal algebra for language theory and graph grammars
• Weighted finite automata over strong bimonoids
• Compositions of tree series transformations
• Effective construction of the syntactic algebra of a recognizable series on trees
• Compositions of extended top-down tree transducers
• Weighted grammars and Kleene's theorem
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Recognizable formal power series on trees
• Morphismes et bimorphismes d'arbres
• IO and OI. I
• IO and OI. II
• General varieties of tree languages
• Equational elements in additive algebras
• Fuzzy tree automata
• Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
• Représentations matricielles des séries d'arbre reconnaissables
• Bottom-up and top-down tree transformations— a comparison
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Algebraic automata and context-free sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item