On the equivalence of Z-automata.
From MaRDI portal
Publication:5716792
Recommendations
- Efficient algorithm for checking multiplicity equivalence for the finite Z-^*-automata
- The equivalence problem of multitape finite automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Rational and Recognisable Power Series
- A note on the equivalence problem of rational formal power series
Cited in
(22)- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Lexicographic decomposition of \(k\)-valued transducers
- Determinisability of unary weighted automata over the rational numbers
- Equational theories for automata
- Axiomatizing rational power series over natural numbers
- Bisimulations for weighted automata over an additively idempotent semiring
- Sequential?
- Simulations of weighted tree automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Free inductive K-semialgebras
- Bisimulations for fuzzy automata
- Efficient algorithm for checking multiplicity equivalence for the finite Z-^*-automata
- Rational and Recognisable Power Series
- Polynomial automata: zeroness and applications
- Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
- Coalgebras for Bisimulation of Weighted Automata over Semirings
- Bideterministic weighted automata
- Bideterministic weighted automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Consistency of relations over monoids
- Quantitative simulations by matrices
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
This page was built for publication: On the equivalence of \(\mathbb{Z}\)-automata.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716792)