Complexity for finite factors of infinite sequences

DOI10.1016/S0304-3975(98)00258-8zbMath0916.68112MaRDI QIDQ1292491

Sébastien Ferenczi, Zoltán Kása

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexityinfinite wordsfinite factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

Algorithms for subsequence combinatorics ⋮ Hierarchical structures in Sturmian dynamical systems ⋮ On the subword complexity of Thue-Morse polynomial extractions ⋮ Quasi-periodic continued fractions ⋮ Subword complexity of uniform D0L words over finite groups ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ Unnamed Item ⋮ Total palindrome complexity of finite words ⋮ Palindrome complexity.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• *-Sturmian words and complexity
• Frequencies of factors of Sturmian sequences
• Codings of rotations and continued fractions
• On the combinatorics of finite words
• Complexity of sequences and dynamical systems
• Sequences with subword complexity \(2n\)
• On the complexity of infinite sequences
• Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
• Covering numbers of rotations
• On the maximum number of distinct factors of a binary string
• Représentation géométrique de suites de complexité $2n+1$

This page was built for publication: Complexity for finite factors of infinite sequences