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