Euclidean strings

Theoretical Computer Science

Volumn 301, Issue 1-3, 2003, Pages 321-340

  Ellis, John ^a   Ruskey, Frank ^a   Sawada, Joe ^b   Simpson, Jamie ^c  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c CURTIN UNIVERSITY   (Australia)

Author keywords

Beatty sequence; Christoffel word; Euclidean algorithm; Fibonacci string; Lyndon word; Morphism; Rational mechanical sequence; Stern Brocot tree; Sturmian sequence

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; TREES (MATHEMATICS);

EUCLIDEAN STRINGS;

INTEGER PROGRAMMING;

EID: 0038709723     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00589-3     Document Type: Article

References (18)

1. Allouche J.-P., Shallit J.O. Automatic Sequences. 2002;Cambridge University Press, Cambridge.
2. Beatty S. Problem 3173. Amer. Math. Monthly. 33:1926;159.
3. Berstel J., de Luca A. Sturmian words, Lyndon words and trees. Theoret. Comput. Sci. 178:1997;171-203.
4. Calkin N., Wilf H.S. Recounting the rationals. Amer. Math. Monthly. 107:2000;360-363.
5. Corman T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;McGraw-Hill, New York.
6. Droubay X. Palindromes in the Fibonacci word. Inform. Process. Lett. 55:1995;217-221.
7. J. Ellis, S. Chow, D. Manke, Embedding grids into cylinders, tori and hypercubes, SIAM J. Comput., to appear.
8. Ellis J., Ruskey F., Sawada J. Euclidean strings. Brankovic L., Ryan J. Proc. Eleventh Australian Workshop on Combinatorial Algorithms. 2000;87-92 University of Newcastle, Australia.
9. Fraenkel A.S. The bracket function and complementary sets of integers. Canad. J. Math. 21:1967;6-27.
10. Fraenkel A.S., Simpson J. The exact number of squares in Fibonacci words. Theoret. Comput. Sci. 218:1999;95-106.
11. Graham R.L., Knuth D.E., Patashnik O. Concrete Mathematics. 1989;Addison-Wesley, Reading, MA.
12. Hardy G.H., Wright E.M. An Introduction to the Theory of Numbers. 1960;Clarendon Press, Oxford.
13. Iliopoulos C.S., Moore D., Smyth W.F. A characterization of the squares in a Fibonacci string. Theoret. Comput. Sci. 172(1-2):1997;281-291.
14. Iliopoulos C.S., Moore D., Smyth W.F. The covers of a circular Fibonacci string. J. Combin. Math. Combin. Comput. 26:1998;227-236.
15. Lothaire M. Algebraic Combinatorics on Words. 2002;Cambridge University Press, Cambridge.
16. de Luca A., Mignosi F. Some combinatorial properties of Sturmian words. Theoret. Comput. Sci. 136:1994;361-385.
17. Ruskey F., Miers C.R., Sawada J. The number of Lyndon words and irreducible polynomials of given trace. SIAM J. Discrete Math. 14:2001;240-245.
18. W. Zhi-Xiong, W. Zhi-Ying, Some properties of the singular words of the Fibonacci word, Séminaire Lotharingien de Combinatoire, 30, 1993.