Approximating probabilistic automata by regular languages
From MaRDI portal
Publication:5079737
Recommendations
Cites work
- scientific article; zbMATH DE number 3135399 (Why is no real title available?)
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Deciding the value 1 problem for probabilistic leaktight automata
- Deciding the value 1 problem for probabilistic leaktight automata
- Definite and Quasidefinite Sets of Stochastic Matrices
- Irregular behaviours for probabilistic automata
- Model checking failure-prone open systems using probabilistic automata
- On finite semigroups of matrices
- On the degree of ambiguity of finite automata
- Power of Randomization in Automata on Infinite Strings
- Probabilistic automata
- Probabilistic automata of bounded ambiguity
- Probabilistic automata on finite words: decidable and undecidable problems
- Probabilistic automata with isolated cut-points
- Products of Indecomposable, Aperiodic, Stochastic Matrices
- Regular separability of one counter automata
- Separation for dot-depth two
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
- When is containment decidable for probabilistic automata?
Cited in
(5)- On the computational complexity of approximating distributions by probabilistic automata
- Concise representations of regular languages by degree and probabilistic finite automata
- scientific article; zbMATH DE number 1979537 (Why is no real title available?)
- Asymptotic approximation by regular languages
- scientific article; zbMATH DE number 7439745 (Why is no real title available?)
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)
