Palindromic rich words and run-length encodings
type: Item
instance of: scholarly article
title: Palindromic rich words and run-length encodings
zbMATH Open document ID: 1371.68221
author: Chuan Guo
author: Arseny M. Shur
author: Jeffrey Shallit
published in: Information Processing Letters
publication date: 2016-08-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1503.09112
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6617211
zbMATH Keywords: combinatorial problems
zbMATH Keywords: palindrome
zbMATH Keywords: rich word
zbMATH Keywords: growth function
zbMATH Keywords: integer partition
describes a project that uses: OEIS
describes a project that uses: EERTREE
MaRDI profile type: MaRDI publication profile
Wikidata QID: Q60692197
OpenAlex ID: W1492505833
cites work: Fast Pattern Matching in Strings
cites work: A Linear-Time On-Line Recognition Algorithm for ``Palstar''
cites work: \(\mathrm{Pal}^{k}\) is linear recognizable online
cites work: Episturmian words and some constructions of de Luca and Rauzy
cites work: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
cites work: Palindromic richness
cites work: Rich and Periodic-Like Words
cites work: Rich, Sturmian, and trapezoidal words
cites work: Q4443440
cites work: Periodic-like words, periodicity, and boxes
cites work: On the number of closed factors in a word
cites work: On intermediate factorial languages
cites work: Q3156941
cites work: Growth properties of power-free languages
DOI: 10.1016/J.IPL.2016.07.001
Recommended article: Palindromic factorization of rich words
Recommended article: Infinite words rich and almost rich in generalized palindromes
Recommended article: Palindromic richness
Recommended article: Generalized Thue-Morse words and palindromic richness
Recommended article: Constructions of words rich in palindromes and pseudopalindromes
Recommended article: Burrows-Wheeler transform and palindromic richness
Recommended article: Identifying approximate palindromes in run-length encoded strings
Recommended article: Upper bound for palindromic and factor complexity of rich words
Recommended article: Efficient retrieval of approximate palindromes in a run-length encoded string
Recommended article: Palindromic subsequences in finite words
description: scientific article; zbMATH DE number 6617211