Some properties of the singular words of the Fibonacci word
European Journal of Combinatorics
Automaticity II: descriptional complexity in the unary case
Theoretical Computer Science
A characterization of substitutive sequences using return words
Discrete Mathematics
Limit values of the recurrence quotient of Sturmian sequences
Theoretical Computer Science
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Abelian complexity and abelian co-decomposition
Theoretical Computer Science
Recurrence in infinite partial words
Theoretical Computer Science
Hi-index | 0.00 |
We survey some results and problems related to the notion of recurrence for infinite words.