Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata |
scientific article; zbMATH DE number 1805871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata |
scientific article; zbMATH DE number 1805871 |
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
0.9363649
0 references
0.90559024
0 references
0.8922794
0 references
0.8902227
0 references
0.88640624
0 references
0.88348913
0 references
0.8826292
0 references
