NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA

DOI10.1142/S0129054108005826zbMath1155.68036MaRDI QIDQ3538850

Rūsiņš Freivalds

Publication date: 24 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

quantum finite automatasize of finite probabilistic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (6)

Multiple Usage of Random Bits in Finite Automata ⋮ Ultrametric Algorithms and Automata ⋮ Amount of nonconstructivity in deterministic finite automata ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Amount of Nonconstructivity in Finite Automata ⋮ Quantum Automata Theory – A Review

Cites Work

• Unnamed Item
• Riemann's hypothesis and tests for primality
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• Theory of transmission of information
• Some aspects of probabilistic automata
• Probabilistic automata

This page was built for publication: NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA