Extensions of rich words
From MaRDI portal
Publication:401472
DOI10.1016/J.TCS.2014.06.033zbMATH Open1307.68063arXiv1312.4350OpenAlexW2054815869MaRDI QIDQ401472FDOQ401472
Authors: Jetro Vesti 
Publication date: 27 August 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: In [X. Droubay et al, Episturmian words and some constructions of de Luca and Rauzy, Theoret. Comput. Sci. 255 (2001)], it was proved that every word w has at most |w|+1 many distinct palindromic factors, including the empty word. The unified study of words which achieve this limit was initiated in [A. Glen et al, Palindromic richness, Eur. Jour. of Comb. 30 (2009)]. They called these words rich (in palindromes). This article contains several results about rich words and especially extending them. We say that a rich word w can be extended richly with a word u if wu is rich. Some notions are also made about the infinite defect of a word, the number of rich words of length n and two-dimensional rich words.
Full work available at URL: https://arxiv.org/abs/1312.4350
Recommendations
Cites Work
- Title not available (Why is that?)
- Palindromic richness
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Episturmian words and some constructions of de Luca and Rauzy
- Infinite words with finite defect
- Title not available (Why is that?)
- Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
- A new characteristic property of rich words
- Palindromic complexity of infinite words associated with simple Parry numbers
- A connection between palindromic and factor complexity using return words
- Complexity and palindromic defect of infinite words
- Rich, Sturmian, and trapezoidal words
- Proof of the Brlek-Reutenauer conjecture
- Burrows-Wheeler transform and palindromic richness
- A remark on morphic sturmian words
- On a conjecture on bidimensional words.
- On periodicity of two-dimensional words
- Periodicity and local complexity
Cited In (11)
- Upper bound for palindromic and factor complexity of rich words
- Palindromic factorization of rich words
- Ostrowski-automatic sequences: theory and applications
- On generalized highly potential words
- Rich and Periodic-Like Words
- A unique extension of rich words
- Rich square-free words
- Rich words in the block reversal of a word
- ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
- The repetition threshold for binary rich words
- On Morphisms Preserving Palindromic Richness
This page was built for publication: Extensions of rich words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401472)
