Episturmian words and episturmian morphisms

From MaRDI portal
Publication:1605314

DOI10.1016/S0304-3975(01)00207-9zbMath1002.68116MaRDI QIDQ1605314

Giuseppe Pirillo, Jacques Justin

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (74)

On a generalization of Christoffel words: epichristoffel wordsSome properties of the Tribonacci sequenceClosed Ziv-Lempel factorization of the \(m\)-bonacci wordsPalindromic complexity of infinite words associated with simple Parry numbersOn the number of partitions of an integer in the \(m\)-bonacci baseMechanical Proofs of Properties of the Tribonacci WordFactor versus palindromic complexity of uniformly recurrent infinite wordsPowers in a class of \(\mathcal A\)-strict standard episturmian wordsConjugacy of morphisms and Lyndon decomposition of standard Sturmian wordsA connection between palindromic and factor complexity using return wordsQuasiperiodic and Lyndon episturmian wordsOn Morphisms Preserving Palindromic RichnessPalindromic prefixes and episturmian wordsCOMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORSFixed points of Sturmian morphisms and their derivated wordsColumn representation of Sturmian words in cellular automataEpisturmian words: a surveyZero-measure Cantor spectrum for Schrödinger operators with low-complexity potentialsOn Sturmian substitutions closed under derivationIntroducing privileged words: privileged complexity of Sturmian wordsOn minimal critical exponent of balanced sequencesSome properties of morphic images of (eventually) dendric wordsComplementary symmetric Rote sequences: the critical exponent and the recurrence functionOpen and closed factors in Arnoux-Rauzy wordsConjugacy and episturmian morphisms.Minimal Complexities for Infinite Words Written with d LettersCritical Exponents of Regular Arnoux-Rauzy SequencesOn non-repetitive complexity of Arnoux-Rauzy wordsOn the Stern-Brocot expansion of real numbersSome properties of the \(k\)-bonacci words on infinite alphabetInitial nonrepetitive complexity of regular episturmian words and their Diophantine exponentsBifix codes and Sturmian wordsSturmian and Episturmian WordsA standard correspondence on epicentral wordsOn a Generalization of Standard Episturmian MorphismsOn some problems related to palindrome closureCharacterization of Infinite LSP Words and Endomorphisms Preserving the LSP PropertyOn sets of indefinitely desubstitutable wordsA coloring problem for infinite wordsOn stabilizers of infinite wordsReturn words in Sturmian and episturmian wordsOn a paper by Castelli, Mignosi, RestivoSturmian jungle (or garden?) on multiliteral alphabetsOn balanced sequences and their asymptotic critical exponentCharacterizations of finite and infinite episturmian words via lexicographic orderingsMorphic images of episturmian words having finite palindromic defectA presentation of a finitely generated submonoid of invertible endomorphisms of the free monoidA characterization of fine words over a finite alphabetEPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMSOn different generalizations of episturmian wordsInvolutions of epicentral wordsOn the fixed points of the iterated pseudopalindromic closure operatorBalancing and clustering of words in the Burrows-Wheeler transformOn a characteristic property of ARNOUX–RAUZY sequencesCharacteristic morphisms of generalized episturmian wordsA condition of Boshernitzan and uniform convergence in the multiplicative ergodic theoremPalindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite wordsA generalized palindromization map in free monoidsEpisturmian morphisms and a Galois theorem on continued fractionsOn z-factorization and c-factorization of standard episturmian wordsThe stable set of a self-mapPseudopalindrome closure operators in free monoidsA palindromization map on free monoidsPalindromic richnessOn a Family of Morphic Images of Arnoux-Rauzy WordsDirective words of episturmian words: equivalences and normalizationBalanced Words Having Simple Burrows-Wheeler TransformSome algorithms to compute the conjugates of Episturmian morphismsOn Sturmian and episturmian words, and related topicsPalindromes in infinite ternary wordsInequalities characterizing standard Sturmian and episturmian wordsOn balanced sequences and their critical exponentPalindrome complexity.Asymptotic repetitive threshold of balanced sequences



Cites Work


This page was built for publication: Episturmian words and episturmian morphisms