A combinatorial proof of \(S\)-adicity for sequences with linear complexity (Q2855577)
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 6220292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial proof of \(S\)-adicity for sequences with linear complexity |
scientific article; zbMATH DE number 6220292 |
Statements
25 October 2013
0 references
\(S\)-adic conjecture
0 references
Rauzy graphs
0 references
factor complexity
0 references
special factor
0 references
return word
0 references
0 references
0.88623124
0 references
0.8785172
0 references
0.8775665
0 references
0.87618256
0 references
0.8728987
0 references
0.8728322
0 references
0.8728034
0 references
A combinatorial proof of \(S\)-adicity for sequences with linear complexity (English)
0 references
