Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
From MaRDI portal
Publication:2635089
zbMath1338.11039arXiv1508.02074MaRDI QIDQ2635089
Luke Schaeffer, Jeffrey O. Shallit
Publication date: 11 February 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02074
Thue-Morse sequence; palindrome; paperfolding sequence; Fibonacci word; decision procedure; balanced word; period-doubling sequence; Rudin-Shapiro sequence; rich word; trapezoidal word; closed word; privileged word
Related Items
Upper bound for palindromic and factor complexity of rich words, On the automaticity of sequences defined by the Thue–Morse and period-doubling Stieltjes continued fractions, Rich words in the block reversal of a word, Counting the number of non-zero coefficients in rows of generalized Pascal triangles, On highly palindromic words: the ternary case, Words with many palindrome pair factors, Upper bound for the number of privileged words, Ostrowski-automatic sequences: theory and applications, Upper bound for the number of closed and privileged words, Open and closed factors in Arnoux-Rauzy words
Cites Work
- Unnamed Item
- Unnamed Item
- Introducing privileged words: privileged complexity of Sturmian words
- A characterization of subshifts with bounded powers
- On factors of synchronized sequences
- Rich, Sturmian, and trapezoidal words
- Palindromic richness
- On the combinatorics of finite words
- Logic and \(p\)-recognizable sets of integers
- A combinatorial problem on trapezoidal words.
- Palindrome complexity.
- Enumeration and structure of trapezoidal words
- A new characteristic property of rich words
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes
- On the Number of Closed Factors in a Word
- On synchronized sequences and their separators
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Rich and Periodic-Like Words
- Automatic Sequences
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On the Number of Unbordered Factors
- Decidability and Enumeration for Automatic Sequences: A Survey
- Subword Complexity and k-Synchronization
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- Episturmian words and some constructions of de Luca and Rauzy
