6533b7d9fe1ef96bd126c0f8
RESEARCH PRODUCT
NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
Rūsiņš Freivaldssubject
Discrete mathematicsDeterministic finite automatonNested wordDFA minimizationDeterministic automatonComputer Science (miscellaneous)Automata theoryQuantum finite automataNondeterministic finite automatonω-automatonMathematicsdescription
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. However, the proof is non-constructive. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures not proved but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2008-06-01 | International Journal of Foundations of Computer Science |