Avoiding squares and overlaps over the natural numbers

DOI10.1016/j.disc.2009.06.004zbMath1215.68193arXiv0901.1397OpenAlexW2079923544MaRDI QIDQ1045019

Mathieu Guay-Paquet, Jeffrey O. Shallit

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.1397

zbMATH Keywords

pattern avoidancecombinatorics on wordsinfinite alphabet

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract) ⋮ Initial non-repetitive complexity of infinite words ⋮ Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability ⋮ Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ Avoiding 3/2-powers over the natural numbers ⋮ Avoiding 5/4-powers on the alphabet of nonnegative integers ⋮ The lexicographically least square-free word with a given prefix ⋮ Unnamed Item ⋮ Profinite automata ⋮ Avoiding fractional powers over the natural numbers

Uses Software

• OEIS

Cites Work

• Unnamed Item
• The ring of \(k\)-regular sequences
• Substitution dynamical systems on infinite alphabets
• On the complexity of infinite words generated by countable \(q\)-automata
• Arithmetics properties of substitutions and infinite automata
• The Towers of Hanoi and Binary Numerals
• Automatic Sequences
• Backtrack Programming