A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
From MaRDI portal
Recommendations
Cited in
(56)- A note on quantum sequential machines
- Equivalence of infinite behavior of finite automata
- On path equivalence of nondeterministic finite automata
- The quest for minimal quotients for probabilistic and Markov automata
- Equivalence checking of quantum finite-state machines
- Hierarchy and equivalence of multi-letter quantum finite automata
- On hybrid models of quantum finite automata
- Weighted path queries on semistructured databases
- Determining the equivalence for one-way quantum finite automata
- When are emptiness and containment decidable for probabilistic automata?
- Model checking differentially private properties
- On the Complexity of the Equivalence Problem for Probabilistic Automata
- Approximate verification and enumeration problems
- scientific article; zbMATH DE number 4203741 (Why is no real title available?)
- Note on the complexity of Las Vegas automata problems
- Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
- EQUIVALENCE OF LABELED MARKOV CHAINS
- scientific article; zbMATH DE number 4100618 (Why is no real title available?)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 2080997 (Why is no real title available?)
- scientific article; zbMATH DE number 1487486 (Why is no real title available?)
- Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- On Nonnegative Integer Matrices and Short Killing Words
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Relations on words
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
- The big-O problem for labelled Markov chains and weighted automata
- On finite monoids over nonnegative integer matrices and short killing words
- Efficient analysis of unambiguous automata using matrix semigroup techniques
- The big-O problem
- Undecidable Problems for Probabilistic Network Programming
- scientific article; zbMATH DE number 7104930 (Why is no real title available?)
- On the Computation of Some Standard Distances Between Probabilistic Automata
- Generalized statistical equivalence of automata
- A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
- Diagnosability of fault patterns with labeled stochastic Petri nets
- Combinatorial algorithms for subsequence matching: a survey
- Does a Program Yield the Right Distribution?
- Porous invariants for linear systems
- Comparing labelled Markov decision processes
- Process symmetry in probabilistic transducers
- Minimising the probabilistic bisimilarity distance
- Weighted basic parallel processes and combinatorial enumeration
- On the complexity of minimizing probabilistic and quantum automata
- State complexity of one-way quantum finite automata together with classical states
- Weighted one-deterministic-counter automata
- PAWS: a tool for the analysis of weighted systems
- Quantitative simulations by matrices
- Braided finite automata and representation theory
- Approximating Markovian testing equivalence
- Characterizations of one-way general quantum finite automata
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- Porous invariants
- Polynomial inference of universal automata from membership and equivalence queries
This page was built for publication: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990650)
