RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA

DOI10.1142/S012905410500325XzbMath1161.68546MaRDI QIDQ5462672

Andreas Maletti

Publication date: 3 August 2005

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Definable transductions and weighted logics for texts ⋮ PURE AND O-SUBSTITUTION ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ On Finite and Polynomial Ambiguity of Weighted Tree Automata ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Equational weighted tree transformations

Cites Work

• Unnamed Item
• Recognizable formal power series on trees
• Equational elements in additive algebras
• Tree series transformations that respect copying
• Context-free series on trees
• Generalized sequential machine maps
• Initial Algebra Semantics and Continuous Algebras
• Mappings and grammars on trees

This page was built for publication: RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA