On the State Complexity of the Shuffle of Regular Languages (Q2829972)
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: On the State Complexity of the Shuffle of Regular Languages |
scientific article; zbMATH DE number 6649505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the State Complexity of the Shuffle of Regular Languages |
scientific article; zbMATH DE number 6649505 |
Statements
On the State Complexity of the Shuffle of Regular Languages (English)
0 references
9 November 2016
0 references
regular language
0 references
shuffle
0 references
state complexity
0 references
upper bound
0 references
0.9098393
0 references
0 references
0.90637314
0 references
0.9017897
0 references
0.9009793
0 references
0 references
0.89437246
0 references
