Conjugacy and Equivalence of Weighted Automata and Functional Transducers

DOI10.1007/11753728_9MaRDI QIDQ3434682zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Elements of automata theory. Translated from the French by Reuben Thomas
• Rational and Recognisable Power Series
• Equations and coequations for weighted automata
• scientific article; zbMATH DE number 6719345
• Automata, Languages and Programming

Cited in

(27)

• Semi-synchronous transductions
• Growth properties of power-free languages
• Bisimulations for weighted automata over an additively idempotent semiring
• Up-To Techniques for Weighted Systems
• A contribution to the determinization of max-plus automata
• Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
• Lexicographic decomposition of \(k\)-valued transducers
• Sequential?
• Computation of the greatest simulations and bisimulations between fuzzy automata
• Bisimulations for fuzzy automata
• scientific article; zbMATH DE number 6747032 (Why is no real title available?)
• Determinisability of unary weighted automata over the rational numbers
• Simulations of weighted tree automata
• Iteration Semirings
• Bideterministic weighted automata
• Bideterministic weighted automata
• Morphisms and Minimisation of Weighted Automata
• Automata and rational expressions
• Equational theories for automata
• Rational and Recognisable Power Series
• A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
• Nondeterministic automata: equivalence, bisimulations, and uniform relations
• Free inductive \(K\)-semialgebras
• A coalgebraic perspective on linear weighted automata
• Axiomatizing rational power series over natural numbers
• Automata, Languages and Programming
• Free iterative and iteration \(K\)-semialgebras

This page was built for publication: Conjugacy and Equivalence of Weighted Automata and Functional Transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434682)