The power of amnesia: learning probabilistic automata with variable memory length
Machine Learning - Special issue on COLT '94
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)
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Weighted automata and weighted logics
Theoretical Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Weighted versus Probabilistic Logics
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Handbook of Weighted Automata
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
Probabilistic automata on infinite words: decidability and undecidability results
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We present a monadic second-order logic which is extended by an expected value operator and show that this logic is expressively equivalent to probabilistic automata for both finite and infinite words. We give possible syntax extensions and an embedding of our probabilistic logic into weighted MSO logic. We further derive decidability results which are based on corresponding results for probabilistic automata.