Complexity for finite factors of infinite sequences
From MaRDI portal
(Redirected from Publication:1292491)
Recommendations
Cites work
- *-Sturmian words and complexity
- Codings of rotations and continued fractions
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Complexity of sequences and dynamical systems
- Covering numbers of rotations
- Frequencies of factors of Sturmian sequences
- scientific article; zbMATH DE number 4085051 (Why is no real title available?)
- scientific article; zbMATH DE number 57959 (Why is no real title available?)
- scientific article; zbMATH DE number 5051583 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- On the combinatorics of finite words
- On the complexity of infinite sequences
- On the maximum number of distinct factors of a binary string
- Représentation géométrique de suites de complexité 2n+1
- Sequences with subword complexity \(2n\)
Cited in
(25)- Asymptotic subword complexity of fixed points of group substitutions
- Total palindrome complexity of finite words
- Language complexity of rotations and Sturmian sequences
- Modified complexity and *-Sturmian word
- Complexity of sequences and dynamical systems
- Sequences with subword complexity \(2n\)
- On the complexity of infinite sequences
- Hierarchical structures in Sturmian dynamical systems
- Palindrome complexity.
- The complexity of generalized Sturmian sequences
- Algorithms for subsequence combinatorics
- On the subword complexity of Thue-Morse polynomial extractions
- Quasi-periodic continued fractions
- On a new notion of complexity on infinite words
- Production en temps réel et complexité de structure de suites infinies
- Rank and symbolic complexity
- Two infinite words with cubic subword complexity
- Global complexities for infinite sequences
- Factor complexity
- On the complexity of finite sequences over a finite set
- The subword complexity of a two-parameter family of sequences
- Opacity complexity of automatic sequences: the general case
- The reflection complexity of sequences over finite alphabets
- Subword complexity of uniform D0L words over finite groups
- Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions
This page was built for publication: Complexity for finite factors of infinite sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292491)
