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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Mathematics and Theoretical Computer Science Jg. 22 no. 1; H. Analysis of Algorithms; S. 1 - 16
Hauptverfasser:	Currie, James D., Mol, Lucas, Rampersad, Narad
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.01.2020 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!