On a conjecture of J. Shallit

DOI10.1007/3-540-63165-8_223zbMath1401.68153OpenAlexW1576108786MaRDI QIDQ4571998

Julien Cassaigne

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_223

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (6)

Reversals and palindromes in continued fractions ⋮ On extremal properties of the Fibonacci word ⋮ A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers ⋮ On the binary expansions of algebraic numbers ⋮ Sturmian words and a criterium by Michaux-Villemaire ⋮ Continued fraction algorithm for Sturmian colorings of trees

Cites Work

• Sequences with subword complexity \(2n\)
• Automaticity. I: Properties of a measure of descriptional complexity
• Unnamed Item

This page was built for publication: On a conjecture of J. Shallit