On the subword complexity of square-free DOL languages (Q1162365)
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 subword complexity of square-free DOL languages |
scientific article; zbMATH DE number 3755896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the subword complexity of square-free DOL languages |
scientific article; zbMATH DE number 3755896 |
Statements
On the subword complexity of square-free DOL languages (English)
0 references
1981
0 references
DOL systems
0 references
nonrepetitive sequences
0 references
0 references
