Conjugacy and Equivalence of Weighted Automata and Functional Transducers
From MaRDI portal
(Redirected from Publication:3434682)
Recommendations
Cited in
(28)- scientific article; zbMATH DE number 6747032 (Why is no real title available?)
- Free inductive K-semialgebras
- Free iterative and iteration K-semialgebras
- Bideterministic weighted automata
- Bisimulations for fuzzy automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Morphisms and Minimisation of Weighted Automata
- A coalgebraic perspective on linear weighted automata
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- PAWS: a tool for the analysis of weighted systems
- 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
- Simulations of weighted tree automata
- Automata, Languages and Programming
- Growth properties of power-free languages
- Axiomatizing rational power series over natural numbers
- 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)
