The Complexity of Probabilistic versus Deterministic Finite Automata

@inproceedings{Ambainis1996TheCO,
  title={The Complexity of Probabilistic versus Deterministic Finite Automata},
  author={Andris Ambainis},
  booktitle={ISAAC},
  year={1996}
}
We show that there exists probabilistic finite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic finite automaton contains Ω(2 n log log n log n ) states.