On a conjecture of J. Shallit

DOI10.1007/3-540-63165-8_223MaRDI QIDQ4571998zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 851423
• Automaticity. II: Descriptional complexity in the unary case
• scientific article; zbMATH DE number 15265
• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• scientific article; zbMATH DE number 2051165

Cites work

• Automaticity. I: Properties of a measure of descriptional complexity
• scientific article; zbMATH DE number 3361800 (Why is no real title available?)
• Sequences with subword complexity \(2n\)

Cited in

(12)

• Reversals and palindromes in continued fractions
• On the binary expansions of algebraic numbers
• On Shallit's minimization problem
• A proof of a conjecture of Shklyarov
• On extremal properties of the Fibonacci word
• scientific article; zbMATH DE number 15265 (Why is no real title available?)
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• scientific article; zbMATH DE number 851423 (Why is no real title available?)
• scientific article; zbMATH DE number 7622938 (Why is no real title available?)
• Continued fraction algorithm for Sturmian colorings of trees
• Sturmian words and a criterium by Michaux-Villemaire
• On a conjecture of Shanks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571998)