๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The exact number of squares in Fibonacci words

โœ Scribed by Aviezri S. Fraenkel; Jamie Simpson


Book ID
104326607
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
706 KB
Volume
218
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Palindromes in the Fibonacci word
โœ Xavier Droubay ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 426 KB
Some Properties of the Singular Words of
โœ Wen Zhi-Xiong; Wen Zhi-Ying ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 324 KB

The combinatorial properties of the Fibonacci infinite word are of great interest in some aspects of mathematics and physics, such as number theory, fractal geometry, formal language, computational complexity, quasicrystals etc. In this note, we introduce the singular words of the Fibonacci infinit

A characterization of the squares in a F
โœ Costas S. Iliopoulos; Dennis Moore; W.F. Smyth ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 675 KB

A (finite) Fibonacci string F, is defined as follows: FO = b, FI = a; for every integer n 2 2, F,, = Fn\_~Fn--2. For n > 1, the length of F,, is denoted by fn = IF,I. The injinite Fibonacci string F is the string which contains every F ,,, n > 1, as a prefix. Apart from their general theoretical imp