Artin’s Conjecture and Size of Finite Probabilistic Automata
From MaRDI portal
(Redirected from Artin’s Conjecture and Size of Finite Probabilistic Automata)
Recommendations
- On the size of unary probabilistic and nondeterministic automata
- scientific article; zbMATH DE number 1960351
- The complexity of probabilistic versus deterministic finite automata
- Probabilistic automata on finite words: decidable and undecidable problems
- Undecidable problems for probabilistic automata of fixed dimension
- Algebraic properties of probabilistic finite automata
- Probabilistic automata on infinite words: decidability and undecidability results
- On the Complexity of the Equivalence Problem for Probabilistic Automata
- scientific article; zbMATH DE number 5734241
- The quest for minimal quotients for probabilistic automata
Cites work
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- scientific article; zbMATH DE number 3632478 (Why is no real title available?)
- scientific article; zbMATH DE number 1516803 (Why is no real title available?)
- scientific article; zbMATH DE number 2090013 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- On Artin's conjecture.
- Probabilistic automata
- Some aspects of probabilistic automata
- The complexity of probabilistic versus deterministic finite automata
- The mathematics of coding theory. Information, compression, error correction and finite fields.
Cited in
(2)
This page was built for publication: Artin’s Conjecture and Size of Finite Probabilistic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452183)
