On the Number of Unbordered Factors

DOI10.1007/978-3-642-37064-9_27zbMath1377.68191arXiv1211.1301MaRDI QIDQ4910467

Daniel Goč, Hamoon Mousavi, Jeffrey O. Shallit

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

linear representation; Thue-Morse sequence; automatic sequence; period-doubling sequence; \(k\)-regular sequence; unbordered factor

Mathematics Subject Classification ID

68R15: Combinatorics on words

11B85: Automata sequences

Related Items

First-Order Logic and Numeration Systems, An Inequality for the Number of Periods in a Word, Additive number theory via automata theory, Asymptotic analysis of \(q\)-recursive sequences, Asymptotic analysis of regular sequences, Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes, Abelian-square-rich words, Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences, Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties, Decision algorithms for Fibonacci-automatic Words, I: Basic results, Mechanical Proofs of Properties of the Tribonacci Word

Cites Work

• Unnamed Item
• Unnamed Item
• A proof of the extended Duval's conjecture
• Periodicity and unbordered segments of words
• Unbordered factors and Lyndon words
• Automatic Theorem-Proving in Combinatorics on Words
• Periodicity and unbordered words
• Least Periods of Factors of Infinite Words
• ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS
• A note on bifix-free sequences (Corresp.)
• Automatic Sequences
• Enumeration and Decidable Properties of Automatic Sequences
• Uniform tag sequences