Nondeterministic automatic complexity of almost square-free and strongly cube-free words (Q2920445)
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 6348544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic automatic complexity of almost square-free and strongly cube-free words |
scientific article; zbMATH DE number 6348544 |
Statements
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words (English)
0 references
26 September 2014
0 references
0.9646751284599304
0 references
0.7874646186828613
0 references
0.7733214497566223
0 references
0.7691255807876587
0 references
0.7553161978721619
0 references
