Balances for fixed points of primitive substitutions.

From MaRDI portal
Publication:1426036

DOI10.1016/S0304-3975(03)00092-6zbMath1059.68083OpenAlexW2146909040MaRDI QIDQ1426036

Boris Adamczewski

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00092-6




Related Items (32)

Mixing properties and entropy bounds of a family of Pisot random substitutionsEpisturmian words: a surveyOn square factors and critical factors of \(k\)-bonacci words on infinite alphabetOn the asymptotic abelian complexity of morphic wordsMultidimensional continued fractions and symbolic codings of toral translationsOn the abelian complexity of generalized Thue-Morse sequencesGeometry, dynamics, and arithmetic of $S$-adic shiftsBalancedness and coboundaries in symbolic systemsAbelian combinatorics on words: a surveyGeneralizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithmsBracket words: A generalisation of Sturmian words arising from generalised polynomialsOn a Class of 2-Balanced SequencesTopological mixing of random substitutionsCharacterizations of families of morphisms and words via binomial complexitiesA note on abelian returns in rotation wordsStudy of irreducible balanced pairs for substitutive languagesFactor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithmS-adic Sequences: A Bridge Between Dynamics, Arithmetic, and GeometrySturmian jungle (or garden?) on multiliteral alphabetsAnother generalization of abelian equivalence: binomial complexity of infinite wordsOn the boundary sequence of an automatic sequenceOn the additive complexity of a Thue-Morse-like sequenceWeak abelian periodicity of infinite wordsRelations on wordsAVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITYOn \(k\)-abelian palindromesCombinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbersBalance and abelian complexity of the Tribonacci wordBalance properties of the fixed point of the substitution associated to quadratic simple Pisot numbersBalances and Abelian Complexity of a Certain Class of Infinite Ternary WordsLattice bounded distance equivalence for 1D Delone sets with finite local complexityAbelian Complexity and Frequencies of Letters in Infinite Words



Cites Work


This page was built for publication: Balances for fixed points of primitive substitutions.