Do the Properties of an S-adic Representation Determine Factor Complexity?
Abstract
The S-adic conjecture postulates the existence of a condition C such that a sequence has linear complexity if and only if it is an S-adic sequence satisfying C for some finite set S of morphisms. We present an overview of the factor complexity of S-adic sequences and we give some examples that either illustrate some interesting properties, or that are counterexamples to what might seem to be a "good" condition C.
| Origin | Files produced by the author(s) |
|---|
Loading...