Equational Weighted Tree Transformations with Discounting

DOI10.1007/978-3-642-24897-9_6zbMath1350.68192OpenAlexW164957689MaRDI QIDQ3098036

George Rahonis, Zoltán Fülöp

Publication date: 11 November 2011

Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_6

zbMATH Keywords

equational semanticsequational weighted tree transformations with discountingrecognizable weighted tree languages with discountingweighted bimorphisms with discounting

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items

On weighted first-order logics with discounting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equational tree transformations
• Basic notions of universal algebra for language theory and graph grammars
• Weighted automata and weighted logics with discounting
• Skew and infinitary formal power series
• Compositions of tree series transformations
• Compositions of extended top-down tree transducers
• Weighted automata with discounting
• 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
• Equational elements in additive algebras
• Alternating Weighted Automata
• Quantitative Languages
• The Power of Extended Top-Down Tree Transducers
• Bottom-up and top-down tree transformations— a comparison
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Algebraic automata and context-free sets
• Stochastic Games