Subword complexity and non-automaticity of certain completely multiplicative functions (Q730313)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subword complexity and non-automaticity of certain completely multiplicative functions |
scientific article |
Statements
Subword complexity and non-automaticity of certain completely multiplicative functions (English)
0 references
27 December 2016
0 references
completely multiplicative functions
0 references
\(k\)-automatic sequences
0 references
subword complexity
0 references
