Exponentially more concise quantum recognition of non-RMM regular languages (Q473186)
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: Exponentially more concise quantum recognition of non-RMM regular languages |
scientific article; zbMATH DE number 6372032
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponentially more concise quantum recognition of non-RMM regular languages |
scientific article; zbMATH DE number 6372032 |
Statements
Exponentially more concise quantum recognition of non-RMM regular languages (English)
0 references
24 November 2014
0 references
quantum finite automata
0 references
equivalence
0 references
regular languages
0 references
deterministic finite automata
0 references
decidability
0 references
state complexity
0 references
0 references
0 references
0.86500573
0 references
0.8611906
0 references
0.8538803
0 references
0 references
0.8322254
0 references
