Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata |
scientific article |
Statements
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (English)
0 references
14 May 2003
0 references
unary automata
0 references
cyclic languages
0 references
