A characterization of the squares in a Fibonacci string

Theoretical Computer Science

Volumn 172, Issue 1-2, 1997, Pages 281-291

  Iliopoulos, Costas S ^a,b   Moore, Dennis ^b   Smyth, W F ^b,c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CURTIN UNIVERSITY   (Australia)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); SYSTEMS ANALYSIS;

FIBONACCI STRING; SQUARES;

AUTOMATA THEORY;

EID: 0031074030     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00141-7     Document Type: Article

References (17)

1. A.V. Aho, Algorithms for finding patterns in strings, Handbook of Theoretical Computer Science (Elsevier, Amsterdam, 1988).
2. A. Apostolico and F.P. Preparata, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci. 22 (1983) 297-315.
3. J. Berstel, Fibonacci words, Book of L (Springer, Berlin, 1986) 13-27.
4. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Inform. Process. Lett. 12 (1981) 244-250.
5. L.J. Cummings, D. Moore and J. Karhumaki, Borders of Fibonacci strings, J. Combin. Math. Combin. Comput., to appear.
6. L.J. Cummings and W.F. Smyth, Weak repetitions in strings, J. Combin. Math. Combin. Comput., to appear.
7. A. de Luca, A combinatorial property of the Fibonacci words, Information Process. Lett. 12 (1981) 193-195.
8. L.E. Dickson, History of the Theory of Numbers (Chelsea, New York, 1971).
9. C.S. Iliopoulos, D. Moore and K. Park, Covering a string, in: Proc. 4th Ann. Symp. on Combinatorial Pattern Matching (1993) 54-62.
10. C.S. Iliopoulos and W.F. Smyth, The covers of a circular Fibonacci String, submitted.
11. D.E. Knuth, The Art of Computer Programming (Addison-Wesley, Reading, MA, 1971).
12. D.E. Knuth, J.H. Morris and V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput, 6 (1977) 322-350.
13. M.G. Main and R.J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984) 422-432.
14. D, Moore and W.F. Smyth, An optimal algorithm to compute all the covers of a string, Inform. Process. Lett. 50 (1994) 239-246.
15. J.J. Pansiot, Mots infinis de Fibonacci et morphismes itérés, RAIRO Inform. Théorique 17 (1983) 131-135.
16. P. Séébold, Propriétés Combinatoires des Mots Infinis Engendrés par Certains Morphismes, Report No. 85-16, LITP, Paris, 1985.
17. T.F. Smith and M.S. Waterman, Identification of common molecular sequences, J. Molecular Biol. 147 (1981) 195-197.