Conjugacy and Equivalence of Weighted Automata and Functional Transducers
From MaRDI portal
Publication:3434682
DOI10.1007/11753728_9zbMATH Open1185.68381OpenAlexW1532577213MaRDI QIDQ3434682FDOQ3434682
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
Recommendations
Cited In (27)
- Title not available (Why is that?)
- Bideterministic weighted automata
- Free inductive \(K\)-semialgebras
- Free iterative and iteration \(K\)-semialgebras
- Bisimulations for fuzzy automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Morphisms and Minimisation of Weighted Automata
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- A coalgebraic perspective on linear weighted automata
- Semi-synchronous transductions
- Bisimulations for weighted automata over an additively idempotent semiring
- Lexicographic decomposition of \(k\)-valued transducers
- Bideterministic weighted automata
- Rational and Recognisable Power Series
- Automata, Languages and Programming
- Simulations of weighted tree automata
- Axiomatizing rational power series over natural numbers
- Growth properties of power-free languages
- Iteration Semirings
- Determinisability of unary weighted automata over the rational numbers
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
- A contribution to the determinization of max-plus automata
- Automata and rational expressions
- Equational theories for automata
- Sequential?
- Up-To Techniques for Weighted Systems
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)
