On the complexity of infinite sequences
From MaRDI portal
Recommendations
Cited in
(64)- Asymptotic subword complexity of fixed points of group substitutions
- On the conjugation of standard morphisms
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Complexity and special factors
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
- On the combinatorics of finite words
- Complexity for finite factors of infinite sequences
- About the p-paperfolding words
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
- Generalization of automatic sequences for numeration systems on a regular language
- Episturmian words and episturmian morphisms
- Words and forbidden factors
- On the values for factor complexity
- An extension of the periodicity lemma to longer periods
- Palindrome complexity.
- Palindromes and Sturmian words
- The subword complexity of a class of infinite binary words
- On the complexity of infinite words generated by countable \(q\)-automata
- Mirror substitutions and palindromic sequences
- On the subword complexity of Thue-Morse polynomial extractions
- Quasi-periodic continued fractions
- Revision sequences and computers with an infinite amount of time
- Complexity functions for two-dimensional sequences
- Three complexity functions
- New second-preimage attacks on hash functions
- Combinatoire de mots récurrents de complexitén+2
- Drunken man infinite words complexity
- Complexity of infinite sequences with zero entropy
- Complexity of sequences with values in a finite set: some examples
- scientific article; zbMATH DE number 4057009 (Why is no real title available?)
- Constructing partial words with subword complexities not achievable by full words
- scientific article; zbMATH DE number 2051150 (Why is no real title available?)
- scientific article; zbMATH DE number 1749140 (Why is no real title available?)
- Compressibility of Deterministic and Random Infinite Sequences
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Production en temps réel et complexité de structure de suites infinies
- Complexity of infinite words associated with beta-expansions
- Relations on words
- Two infinite words with cubic subword complexity
- Global complexities for infinite sequences
- Entropy ratio for infinite sequences with positive entropy
- On minimal Sturmian partial words
- Finite State Incompressible Infinite Sequences
- On the complexity of finite sequences over a finite set
- Combinatorial properties of infinite words associated with cut-and-project sequences
- Statistical estimation of the structure of a finite population
- A characterization of Sturmian words by return words
- Double sequences of low complexity
- Substitutions and interval exchange transformations of rotation class
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Complexity and palindromic defect of infinite words
- Subword complexity of a generalized Thue-Morse word
- Opacity complexity of automatic sequences: the general case
- Generalized natural density \(DF(\mathfrak{F}_k)\) of Fibonacci word
- A Pansiot-type subword complexity theorem for automorphisms of free groups
- The reflection complexity of sequences over finite alphabets
- Subword complexity of uniform D0L words over finite groups
- On the study of cellular automata on modulo-recurrent words
- On the complexity of a family of \(k\)-context-free sequences
- Behavior of various complexity functions
- A two-parameter family of an extension of Beatty sequences
- Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions
- On complexity functions of infinite words associated with generalized Dyck languages
This page was built for publication: On the complexity of infinite sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326948)
