Effective construction of the syntactic algebra of a recognizable series on trees

DOI10.1007/BF01893886zbMath0697.68074MaRDI QIDQ911788

Symeon Bozapalidis

Publication date: 1991

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

Mathematics Subject Classification ID

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

Related Items (19)

Fuzzy tree automata ⋮ Definable transductions and weighted logics for texts ⋮ Weighted tree automata and weighted logics ⋮ Minimisation of Multiplicity Tree Automata ⋮ THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA ⋮ Varieties of recognizable tree series over fields ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ On the syntactic complexity of tree series ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ Simulations of Weighted Tree Automata ⋮ On Finite and Polynomial Ambiguity of Weighted Tree Automata ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids ⋮ Equational weighted tree transformations ⋮ Weighted automata ⋮ Minimizing deterministic weighted tree automata ⋮ Recognizable formal series on trees and cofree coalgebraic systems ⋮ Some remarks on recognizable treeseries ⋮ On two families of forests

Cites Work

• Unnamed Item
• Unnamed Item
• The rank of a formal tree power series
• Series formelles et algèbres syntactiques
• Recognizable formal power series on trees
• Représentations matricielles des séries d'arbre reconnaissables

This page was built for publication: Effective construction of the syntactic algebra of a recognizable series on trees