$N$-factor complexity of the infinite Fibonacci sequence and digital sequences (Q6421073)
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: $N$-factor complexity of the infinite Fibonacci sequence and digital sequences |
scientific article; zbMATH DE number 900555568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | $N$-factor complexity of the infinite Fibonacci sequence and digital sequences |
scientific article; zbMATH DE number 900555568 |
Statements
20 December 2022
0 references
math.CO
0 references
