The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005)
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: The Average State Complexity of the Star of a Finite Set of Words Is Linear |
scientific article; zbMATH DE number 5359022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Average State Complexity of the Star of a Finite Set of Words Is Linear |
scientific article; zbMATH DE number 5359022 |
Statements
The Average State Complexity of the Star of a Finite Set of Words Is Linear (English)
0 references
30 October 2008
0 references
0.86017704
0 references
0.8505316
0 references
0.84568715
0 references
0.84539497
0 references
0.84361756
0 references
0.84315866
0 references
0.8410389
0 references
0.8375455
0 references
0.8373639
0 references
