Minimum complexity of automatic non sturmian sequences

DOI10.1051/ita/1995290402851zbMath0838.68057OpenAlexW1843278374MaRDI QIDQ4858845

Théodore Tapsoba

Publication date: 20 December 1995

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92510

zbMATH Keywords

automatic non Sturmian sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

How to prove that a sequence is not automatic ⋮ Cobham’s Theorem and Automaticity

Cites Work

• Unnamed Item
• Unnamed Item
• Automates finis et ensembles normaux. (Finite automata and normal sets)
• Automata calculating the complexity of automatic sequences
• Special factors of automatic sequences
• Suites algébriques, automates et substitutions
• Uniform tag sequences
• Sequences with minimal block growth

This page was built for publication: Minimum complexity of automatic non sturmian sequences