On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)

DOI10.1145/195058.195431zbMath1345.68203OpenAlexW2057894000MaRDI QIDQ2817662

Anne Condon, Samuel Pottle, Avi Wigderson, Lisa Hellerstein

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195431

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Automaticity. II: Descriptional complexity in the unary case