MINIMUM COMPLEXITY OF AUTOMATIC NON STURMIAN SEQUENCES

摘要

Nous déterminons la complexité minimum des suites automatiques non Sturmiennes (points fixes de substitutions injectives uniformes) sur des alphabets de cardinal deux.%We determine the minimum complexity of automatic non Sturmian sequences (fixed points of injective constant-length substitutions) on sets of two elements.