A rewriting of Fife's theorem about overlap-free words

DOI10.1007/3-540-58131-6_34zbMath1529.68233OpenAlexW4319451620MaRDI QIDQ6142867

Jean Berstel

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_34

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Enumeration of irreducible binary words
• On infinite words obtained by iterating morphisms
• Overlap-free words and finite automata
• Chains and fixing blocks in irreducible binary sequences
• A linear-time algorithm to decide whether a binary word contains an overlap
• Binary Sequences which Contain no BBb
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A rewriting of Fife's theorem about overlap-free words