Episturmian words: a survey

From MaRDI portal
Publication:5321774

DOI10.1051/ita/2009003zbMath1182.68155arXiv0801.1655OpenAlexW3101456301MaRDI QIDQ5321774

Amy Glen, Jacques Justin

Publication date: 15 July 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1655



Related Items

Symmetry groups of infinite words, On a generalization of Christoffel words: epichristoffel words, Mechanical Proofs of Properties of the Tribonacci Word, Palindromic Complexity of Trees, A connection between palindromic and factor complexity using return words, Quasiperiodic and Lyndon episturmian words, On the structure of bispecial Sturmian words, On Morphisms Preserving Palindromic Richness, Arnoux-Rauzy interval exchanges, Fixed points of Sturmian morphisms and their derivated words, On square factors and critical factors of \(k\)-bonacci words on infinite alphabet, On the group of a rational maximal bifix code, Introducing privileged words: privileged complexity of Sturmian words, Properties of a ternary infinite word, Abelian periods of factors of Sturmian words, Counting distinct palindromes in a word in linear time, The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group, Minimal Complexities for Infinite Words Written with d Letters, On non-repetitive complexity of Arnoux-Rauzy words, Clustering and Arnoux-Rauzy words, On theta-palindromic richness, Some properties of the \(k\)-bonacci words on infinite alphabet, Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents, Bifix codes and Sturmian words, A standard correspondence on epicentral words, A characterization of words of linear complexity, Sturmian jungle (or garden?) on multiliteral alphabets, Morphic images of episturmian words having finite palindromic defect, A geometric interpretation of the Schützenberger group of a minimal subshift, The finite index basis property, On the fixed points of the iterated pseudopalindromic closure operator, Balancing and clustering of words in the Burrows-Wheeler transform, Special factors and the combinatorics of suffix and factor automata, On the number of episturmian palindromes, A new characteristic property of rich words, Balance and abelian complexity of the Tribonacci word, Standard factors of Sturmian words, On z-factorization and c-factorization of standard episturmian words, A palindromization map on free monoids, Maximal bifix decoding, The repetition threshold for binary rich words, Palindromic richness, Balanced Words Having Simple Burrows-Wheeler Transform, BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS, Unnamed Item, Lamination languages, Rich square-free words



Cites Work