Conjugacy and Equivalence of Weighted Automata and Functional Transducers

DOI10.1007/11753728_9zbMath1185.68381OpenAlexW1532577213MaRDI QIDQ3434682

Sylvain Lombardy, Jacques Sakarovitch, Marie-Pierre Béal

Publication date: 2 May 2007

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753728_9

Mathematics Subject Classification ID

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

Related Items

Morphisms and Minimisation of Weighted Automata ⋮ Axiomatizing rational power series over natural numbers ⋮ Rational and Recognisable Power Series ⋮ A contribution to the determinization of max-plus automata ⋮ Free inductive \(K\)-semialgebras ⋮ Bideterministic weighted automata ⋮ Free iterative and iteration \(K\)-semialgebras ⋮ A coalgebraic perspective on linear weighted automata ⋮ Bideterministic weighted automata ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Lexicographic decomposition of \(k\)-valued transducers ⋮ Iteration Semirings ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ Growth properties of power-free languages ⋮ Up-To Techniques for Weighted Systems ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ Sequential? ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Simulations of Weighted Tree Automata ⋮ Semi-synchronous transductions ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Automata and rational expressions ⋮ Equational theories for automata