Probabilistic automata and probabilistic logic
DOI10.1007/978-3-642-32589-2_70zbMATH Open1365.03027OpenAlexW102227657MaRDI QIDQ2912781FDOQ2912781
Authors: Thomas Weidner 
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_70
Recommendations
- Probabilistic automata on infinite words: decidability and undecidability results
- Probabilistic automata over infinite words: expressiveness, efficiency, and decidability
- Probabilistic regular expressions and MSO logic on finite trees
- Decidable problems for probabilistic automata on infinite words
- Probabilistic Weighted Automata
Formal languages and automata (68Q45) Probability and inductive logic (03B48) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Cited In (8)
- Title not available (Why is that?)
- Decomposition and factorization of chemical reaction transducers
- Probabilistic ω-automata
- Probabilism versus Alternation for Automata
- Probabilistic asynchronous automata
- Probabilistic Automata for Safety LTL Specifications
- Quantitative Verification of Stochastic Regular Expressions
- Quantitative Automata under Probabilistic Semantics
This page was built for publication: Probabilistic automata and probabilistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912781)
