Language Recognition Power and Succinctness of Affine Automata (Q2819147)
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: Language Recognition Power and Succinctness of Affine Automata |
scientific article; zbMATH DE number 6630589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Language Recognition Power and Succinctness of Affine Automata |
scientific article; zbMATH DE number 6630589 |
Statements
Language Recognition Power and Succinctness of Affine Automata (English)
0 references
28 September 2016
0 references
probabilistic automata
0 references
quantum automata
0 references
affine automata
0 references
state complexity
0 references
stochastic language
0 references
bounded-error
0 references
one-sided error
0 references
0.99999976
0 references
0.8897307
0 references
0.8847311
0 references
0.8845054
0 references
0.8759207
0 references
