A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
From MaRDI portal
Publication:3990650
DOI10.1137/0221017zbMath0755.68075MaRDI QIDQ3990650
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221017
nondeterministic finite automata; approximate equivalence; unambiguous finite automata; path equivalence
Related Items
Unnamed Item, Unnamed Item, On Nonnegative Integer Matrices and Short Killing Words, Unnamed Item, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, 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, Relations on words, On the complexity of minimizing probabilistic and quantum automata, Quantitative simulations by matrices, 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, A note on quantum sequential machines, 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?, Trace Refinement in Labelled Markov Decision Processes, Minimisation of Multiplicity Tree Automata, Note on the complexity of Las Vegas automata problems, EQUIVALENCE OF LABELED MARKOV CHAINS
