A polynomial-time algorithm for the equivalence of probabilistic automata
SIAM Journal on Computing
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
On some variations of two-way probabilistic finite automata models
Theoretical Computer Science
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the power of 2-way probabilistic finite state automata
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Language and Automata Theory and Applications
Weighted path queries on semistructured databases
Information and Computation
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Probabilistic automata on finite words: decidable and undecidable problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Pebble weighted automata and transitive closure logics
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Quantitative Kleene coalgebras
Information and Computation
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Probabilistic automata and probabilistic logic
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We provide a Kleene Theorem for (Rabin) probabilistic automata over finite words. Probabilistic automata generalize deterministic finite automata and assign to a word an acceptance probability. We provide probabilistic expressions with probabilistic choice, guarded choice, concatenation, and a star operator. We prove that probabilistic expressions and probabilistic automata are expressively equivalent. Our result actually extends to two-way probabilistic automata with pebbles and corresponding expressions.