Episturmian words and some constructions of de Luca and Rauzy

From MaRDI portal
Publication:5941085

DOI10.1016/S0304-3975(99)00320-5zbMath0981.68126OpenAlexW2005055946WikidataQ90835213 ScholiaQ90835213MaRDI QIDQ5941085

Jacques Justin, Giuseppe Pirillo, Xavier Droubay

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00320-5




Related Items (only showing first 100 items - show all)

RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDSScattered Factor-Universality of WordsCodes and Automata in Minimal SetsMechanical Proofs of Properties of the Tribonacci WordSpecular SetsPalindromic Complexity of TreesClosed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequencesOn Morphisms Preserving Palindromic RichnessCOMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORSArnoux-Rauzy interval exchangesEpisturmian words: a surveyThe Burrows-Wheeler Transform between Data Compression and Combinatorics on WordsA unique extension of rich wordsEnumeration of two dimensional palindromesTight bound for the number of distinct palindromes in a treeThe palindromization mapFinding top-\(k\) longest palindromes in substringsAbsent Subsequences in WordsComplementary symmetric Rote sequences: the critical exponent and the recurrence functionAbelian combinatorics on words: a surveyString Attractors for Factors of the Thue-Morse WordCritical Exponents of Regular Arnoux-Rauzy SequencesString attractors of episturmian sequencesFinite and infinite closed-rich wordsRich words in the block reversal of a wordClustering and Arnoux-Rauzy wordsInitial nonrepetitive complexity of regular episturmian words and their Diophantine exponentsAn upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequenceSturmian and Episturmian WordsPerfect balance and circularly rich wordsOn a Generalization of Standard Episturmian MorphismsUnnamed ItemStudy of irreducible balanced pairs for substitutive languagesOn some problems related to palindrome closureCharacterization of Infinite LSP Words and Endomorphisms Preserving the LSP PropertyReturn words in Sturmian and episturmian wordsOn a paper by Castelli, Mignosi, RestivoSturmian jungle (or garden?) on multiliteral alphabetsCounting Palindromes in SubstringsALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDSPalindrome Pattern MatchingON THE PALINDROMIC COMPLEXITY OF INFINITE WORDSEPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMSDescribing the Set of Words Generated by Interval Exchange TransformationGeneralized Thue-Morse words and palindromic richnessOn a characteristic property of ARNOUX–RAUZY sequencesStandard factors of Sturmian wordsEpisturmian morphisms and a Galois theorem on continued fractionsPalindromes in starlike treesA new estimate on complexity of binary generalized pseudostandard wordsFixed points of morphisms among binary generalized pseudostandard wordsThe repetition threshold for binary rich wordsOn a Family of Morphic Images of Arnoux-Rauzy WordsDirective words of episturmian words: equivalences and normalizationRich and Periodic-Like WordsBalanced Words Having Simple Burrows-Wheeler TransformSome algorithms to compute the conjugates of Episturmian morphismsOn Sturmian and episturmian words, and related topicsCOMBINATORIAL PROPERTIES OF STURMIAN PALINDROMESSOME EXTREMAL PROPERTIES OF THE FIBONACCI WORDInequalities characterizing standard Sturmian and episturmian wordsCodings of rotations on two intervals are fullRauzy substitutions and multi-dimensional Sturmian wordsUpper bound for palindromic and factor complexity of rich wordsPalindromic language of thin discrete planesSpecular sets\(m\)-balanced words: A generalization of balanced wordsOn a generalization of Christoffel words: epichristoffel wordsClosed Ziv-Lempel factorization of the \(m\)-bonacci wordsPalindromic complexity of infinite words associated with simple Parry numbersPowers in a class of \(\mathcal A\)-strict standard episturmian wordsAperiodic pseudorandom number generators based on infinite wordsA connection between palindromic and factor complexity using return wordsPalindromic factorization of rich wordsQuasiperiodic and Lyndon episturmian wordsMinimal unique palindromic substrings after single-character substitutionLower bounds for the number of repetitions in 2D stringsPalindromic prefixes and episturmian wordsThe numbers of repeated palindromes in the Fibonacci and Tribonacci wordsZero-measure Cantor spectrum for Schrödinger operators with low-complexity potentialsEERTREE: an efficient data structure for processing palindromes in stringsOn the least number of palindromes contained in an infinite wordString powers in treesIntroducing privileged words: privileged complexity of Sturmian wordsOn a generalization of abelian equivalence and complexity of infinite wordsLanguages invariant under more symmetries: overlapping factors versus palindromic richnessPalindrome pattern matchingPalindromic richness for languages invariant under more symmetriesOn palindromic factorization of wordsPalindromes in circular wordsExtensions of rich wordsNormalization of ternary generalized pseudostandard wordsPalindromic length of words and morphisms in class \(\mathcal{P}\)A counterexample to a question of Hof, Knill and SimonComplexity and palindromic defect of infinite wordsCounting distinct palindromes in a word in linear timeOn prefixal factorizations of wordsOpen and closed factors in Arnoux-Rauzy wordsConjugacy and episturmian morphisms.Morphisms generating antipalindromic words



Cites Work


This page was built for publication: Episturmian words and some constructions of de Luca and Rauzy