On a conjecture of J. Shallit

DOI10.1007/3-540-63165-8_223zbMATH Open1401.68153OpenAlexW1576108786MaRDI QIDQ4571998FDOQ4571998

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

Recommendations

• Publication:4867898
• 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

Mathematics Subject Classification ID

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

Cites Work

• Sequences with subword complexity \(2n\)
• Automaticity. I: Properties of a measure of descriptional complexity
• Title not available (Why is that?)

Cited In (12)

• On the binary expansions of algebraic numbers
• Title not available (Why is that?)
• On a conjecture of Shanks
• Sturmian words and a criterium by Michaux-Villemaire
• Title not available (Why is that?)
• Continued fraction algorithm for Sturmian colorings of trees
• Reversals and palindromes in continued fractions
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• On Shallit's minimization problem
• Title not available (Why is that?)
• On extremal properties of the Fibonacci word
• A proof of a conjecture of Shklyarov

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)