Pages that link to "Item:Q3990650"
From MaRDI portal
The following pages link to A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (Q3990650):
Displayed 34 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
- Relations on words (Q505060) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Quantitative simulations by matrices (Q729815) (← links)
- Approximating Markovian testing equivalence (Q764291) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Porous invariants (Q832262) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- On path equivalence of nondeterministic finite automata (Q1351166) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Weighted path queries on semistructured databases (Q2495649) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- Model checking differentially private properties (Q2680992) (← links)
- Trace Refinement in Labelled Markov Decision Processes (Q2811347) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- EQUIVALENCE OF LABELED MARKOV CHAINS (Q3538849) (← links)
- (Q4558784) (← links)
- On Nonnegative Integer Matrices and Short Killing Words (Q4992844) (← links)
- (Q5089308) (← links)
- On finite monoids over nonnegative integer matrices and short killing words (Q5090493) (← links)
- (Q5092446) (← links)
- (Q5094125) (← links)
- Undecidable Problems for Probabilistic Network Programming (Q5111285) (← links)
- (Q5232904) (← links)
- Diagnosability of fault patterns with labeled stochastic Petri nets (Q6190046) (← links)
- (Q6190431) (← links)