Approximating probabilistic automata by regular languages
From MaRDI portal
Publication:5079737
DOI10.4230/LIPICS.CSL.2018.14MaRDI QIDQ5079737FDOQ5079737
Authors:
Publication date: 28 May 2022
Recommendations
Cites Work
- Probabilistic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic automata on finite words: decidable and undecidable problems
- Products of Indecomposable, Aperiodic, Stochastic Matrices
- On finite semigroups of matrices
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
- Definite and Quasidefinite Sets of Stochastic Matrices
- Title not available (Why is that?)
- Deciding the value 1 problem for probabilistic leaktight automata
- Deciding the value 1 problem for probabilistic leaktight automata
- On the degree of ambiguity of finite automata
- Power of Randomization in Automata on Infinite Strings
- Separation for dot-depth two
- Probabilistic automata of bounded ambiguity
- Irregular behaviours for probabilistic automata
- Probabilistic automata with isolated cut-points
- Model checking failure-prone open systems using probabilistic automata
- When is containment decidable for probabilistic automata?
- Regular separability of one counter automata
Cited In (5)
This page was built for publication: Approximating probabilistic automata by regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079737)