Quantum state complexity of formal languages (Q5500700)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6471686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum state complexity of formal languages |
scientific article; zbMATH DE number 6471686 |
Statements
Quantum State Complexity of Formal Languages (English)
0 references
7 August 2015
0 references
quantum finite automaton
0 references
quantum state complexity
0 references
approximate matrix rank
0 references
minimal automaton
0 references
advice
0 references
timed crossing sequence
0 references
permutation automaton
0 references
0 references
0 references
0.8263208866119385
0 references
0.8077983260154724
0 references
0.8077983260154724
0 references
0.8053230047225952
0 references
0.8034687042236328
0 references
