The repetition threshold for binary rich words

A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\sqrt{2}/2$ ($\approx 2.707$) and conjectured that this was the least pos...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 22 no. 1; číslo Analysis of Algorithms; s. 1 - 16
Hlavní autori:	Currie, James D., Mol, Lucas, Rampersad, Narad
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.01.2020 Discrete Mathematics & Theoretical Computer Science
Predmet:	68r15 Codes computer science - formal languages and automata theory Engineering research Mathematical research mathematics - combinatorics Palindromes Repetition Words Canada
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!