Language recognition power and succinctness of affine automata (Q6061995)
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 7772432
| 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 7772432 |
Statements
Language recognition power and succinctness of affine automata (English)
0 references
30 November 2023
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.9988677501678468
0 references
0.8472018241882324
0 references
0.8375565409660339
0 references
0.8362581729888916
0 references
0.8153049349784851
0 references
