Complexity for finite factors of infinite sequences
From MaRDI portal
Publication:1292491
DOI10.1016/S0304-3975(98)00258-8zbMATH Open0916.68112MaRDI QIDQ1292491FDOQ1292491
Authors: Sébastien Ferenczi, Zoltán Kása 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Représentation géométrique de suites de complexité $2n+1$
- Title not available (Why is that?)
- On the complexity of infinite sequences
- Sequences with subword complexity \(2n\)
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Complexity of sequences and dynamical systems
- On the combinatorics of finite words
- Frequencies of factors of Sturmian sequences
- Codings of rotations and continued fractions
- *-Sturmian words and complexity
- On the maximum number of distinct factors of a binary string
- Covering numbers of rotations
- Title not available (Why is that?)
Cited In (18)
- On a new notion of complexity on infinite words
- Hierarchical structures in Sturmian dynamical systems
- Global complexities for infinite sequences
- Subword complexity of uniform D0L words over finite groups
- Asymptotic subword complexity of fixed points of group substitutions
- Palindrome complexity.
- Title not available (Why is that?)
- Algorithms for subsequence combinatorics
- Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions
- Rank and symbolic complexity
- The complexity of generalized Sturmian sequences
- Factor complexity
- The subword complexity of a two-parameter family of sequences
- On the subword complexity of Thue-Morse polynomial extractions
- Quasi-periodic continued fractions
- On the complexity of infinite sequences
- Total palindrome complexity of finite words
- Production en temps réel et complexité de structure de suites infinies
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)
