NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
From MaRDI portal
Publication:3538850
DOI10.1142/S0129054108005826zbMath1155.68036MaRDI QIDQ3538850
Publication date: 24 November 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Exponentially more concise quantum recognition of non-RMM regular languages, Amount of nonconstructivity in deterministic finite automata, Multiple Usage of Random Bits in Finite Automata, Ultrametric Algorithms and Automata, Quantum Automata Theory – A Review, Amount of Nonconstructivity in Finite Automata
Cites Work