A Characterization of the Squares in a Fibonacci String

@article{Iliopoulos1997ACO,
  title={A Characterization of the Squares in a Fibonacci String},
  author={Costas S. Iliopoulos and Dennis W. G. Moore and William F. Smyth},
  journal={Theor. Comput. Sci.},
  year={1997},
  volume={172},
  pages={281-291}
}
A ((nite) Fibonacci string F n is deened as follows: F 0 = b, F 1 = a; for every integer n 2, F n = F n?1 F n?2. For n 1, the length of F n is denoted by f n = jF n j. The innnite Fibonacci string F is the string which contains every F n , n 1, as a preex. Apart from their general theoretical importance, Fibonacci strings are often cited as worst case examples for algorithms which compute all the repetitions or all the \Abelian squares" in a given string. In this paper we provide a… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Algorithms for nding patterns in strings. Handbook of Theoretical Computer Science

A V Aho
Algorithms for nding patterns in strings. Handbook of Theoretical Computer Science • 1988

Fibonacci words. Book of L

J Berstel
Fibonacci words. Book of L • 1986

Propri et es Combinatoires des Mots Innnis Engendr es par Certains Morphismes

P S Ebold
Propri et es Combinatoires des Mots Innnis Engendr es par Certains Morphismes • 1985

A combinatorial property of the Fibonacci words

A De Luca
Information Processing Letters • 1981

Similar Papers

Loading similar papers…