Complexité des facteurs des mots infinis engendrés par morphismes itérés
From MaRDI portal
Publication:3217626
DOI10.1007/3-540-13345-3_34zbMath0554.68053OpenAlexW67338565MaRDI QIDQ3217626
Publication date: 1984
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-13345-3_34
Related Items (46)
On the joint subword complexity of automatic sequences ⋮ On the complexity of infinite words generated by countable \(q\)-automata ⋮ Computing abelian complexity of binary uniform morphic words ⋮ On almost periodicity of morphic sequences ⋮ Syndeticity and independent substitutions ⋮ New second-preimage attacks on hash functions ⋮ Subword Complexity and Decomposition of the Set of Factors ⋮ Logarithmic equal-letter runs for BWT of purely morphic words ⋮ Transcendence of numbers with a low complexity expansion ⋮ On the asymptotic abelian complexity of morphic words ⋮ A simple approach to minimal substitution subshifts ⋮ Free ergodic ℤ²-systems and complexity ⋮ Automatic sequences: from rational bases to trees ⋮ String attractors and infinite words ⋮ Infinite interval exchange transformations from shifts ⋮ Drunken man infinite words complexity ⋮ General Framework ⋮ Some improvements of the \(S\)-adic conjecture ⋮ Balances for fixed points of primitive substitutions. ⋮ A characterization of words of linear complexity ⋮ ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS ⋮ Invariant measures for Cantor dynamical systems ⋮ Cost and dimension of words of zero topological entropy ⋮ On a class of infinite words with affine factor complexity ⋮ On the subword complexity of Thue-Morse polynomial extractions ⋮ Relations on words ⋮ On complexity functions of infinite words associated with generalized Dyck languages ⋮ Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ Invariant measures on stationary Bratteli diagrams ⋮ The complexity of Fibonacci-like kneading sequences ⋮ Some remarks about stabilizers ⋮ Subword complexity of uniform D0L words over finite groups ⋮ Spectral properties of Schrödinger operators associated with almost minimal substitution systems ⋮ The automorphism group of a shift of subquadratic growth ⋮ On automorphism groups of low complexity subshifts ⋮ Periodicity of morphic words ⋮ On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ On recognizable sets of integers ⋮ SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS ⋮ Unnamed Item ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ Abelian Complexity and Frequencies of Letters in Infinite Words ⋮ Generalization of automatic sequences for numeration systems on a regular language ⋮ Palindrome complexity.
This page was built for publication: Complexité des facteurs des mots infinis engendrés par morphismes itérés
