On the complexity of infinite sequences
From MaRDI portal
Publication:1326948
zbMath0803.68094MaRDI QIDQ1326948
Publication date: 2 January 1995
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226837
complexityautomatic sequencessubstitutive sequencesCD0L sequencesfactors of infinite wordssubwords of infinite words
Related Items
The subword complexity of a class of infinite binary words, On the complexity of infinite words generated by countable \(q\)-automata, About the \(p\)-paperfolding words, New second-preimage attacks on hash functions, Complexity of infinite words associated with beta-expansions, On the conjugation of standard morphisms, Complexity and palindromic defect of infinite words, Bracket words: A generalisation of Sturmian words arising from generalised polynomials, Combinatoire de mots récurrents de complexitén+2, Constructing partial words with subword complexities not achievable by full words, Drunken man infinite words complexity, Palindromes and Sturmian words, Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\)., A two-parameter family of an extension of Beatty sequences, Subword complexity of a generalized Thue-Morse word, Mirror substitutions and palindromic sequences, On the subword complexity of Thue-Morse polynomial extractions, Relations on words, Quasi-periodic continued fractions, On complexity functions of infinite words associated with generalized Dyck languages, Toeplitz words, generalized periodicity and periodically iterated morphisms, A characterization of Sturmian words by return words, On minimal Sturmian partial words, An extension of the periodicity lemma to longer periods, Double sequences of low complexity, Substitutions and interval exchange transformations of rotation class, Combinatorial properties of infinite words associated with cut-and-project sequences, Subword complexity of uniform D0L words over finite groups, Asymptotic subword complexity of fixed points of group substitutions, Reconnaissabilité des substitutions et complexité des suites automatiques, Combinatorics on patterns of a bidimensional Sturmian sequence, Unnamed Item, On the complexity of a family of \(k\)-context-free sequences, The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity, Generalization of automatic sequences for numeration systems on a regular language, On the combinatorics of finite words, Complexity for finite factors of infinite sequences, Palindrome complexity., Episturmian words and episturmian morphisms, Words and forbidden factors
