DOIAbstract
We survey several quantitative problems on infinite words related to repetitions, recurrence, and palindromes, for which the Fibonacci word often exhibits extremal behaviour
We survey several quantitative problems on infinite words related to repetitions, recurrence, and palindromes, for which the Fibonacci word often exhibits extremal behaviour
AbstractIt is well-known that the Fibonacci numbers have a maximum property with respect to the leng...
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
Abstract. We introduce a representation of subwords of the infinite Fibonacci word f ∞ by a specific...
We survey several quantitative problems on infinite words related to repetitions, recurrence, and pa...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
AbstractThe words we consider in this paper are defined by some self-similarity conditions which in ...
AbstractThe combinatorial properties of the Fibonacci infinite word are of great interest in some as...
Colloque avec actes et comité de lecture.A (fractional) repetition in a word $w$ is a subword with t...
We implement a decision procedure for answering questions about a class of infinite words that might...
Recently the Fibonacci word W on an infinite alphabet was introduced by Zhang et al..
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in ni...
Abstract. In the present article, we study a word-combinatorial interpretation of the biperiodic Fib...
AbstractLet Φ be the golden ratio (√5 + 1)/2, fn the nth Fibonacci finite word and f the Fibonacci i...
AbstractWe prove that characteristic Sturmian words are extremal for the Critical Factorization Theo...
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
AbstractIt is well-known that the Fibonacci numbers have a maximum property with respect to the leng...
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
Abstract. We introduce a representation of subwords of the infinite Fibonacci word f ∞ by a specific...
We survey several quantitative problems on infinite words related to repetitions, recurrence, and pa...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
AbstractThe words we consider in this paper are defined by some self-similarity conditions which in ...
AbstractThe combinatorial properties of the Fibonacci infinite word are of great interest in some as...
Colloque avec actes et comité de lecture.A (fractional) repetition in a word $w$ is a subword with t...
We implement a decision procedure for answering questions about a class of infinite words that might...
Recently the Fibonacci word W on an infinite alphabet was introduced by Zhang et al..
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in ni...
Abstract. In the present article, we study a word-combinatorial interpretation of the biperiodic Fib...
AbstractLet Φ be the golden ratio (√5 + 1)/2, fn the nth Fibonacci finite word and f the Fibonacci i...
AbstractWe prove that characteristic Sturmian words are extremal for the Critical Factorization Theo...
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
AbstractIt is well-known that the Fibonacci numbers have a maximum property with respect to the leng...
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
Abstract. We introduce a representation of subwords of the infinite Fibonacci word f ∞ by a specific...
Add to ORKG