Abstract
For heuristic reasons billiard words may have more palindromic factors than any other words. Many results are already known, concerning the palindromic factors and the palindromic prefixes of Sturmian words and billiard words on two letters. We give general results concerning multidimensional billiard words, which describe very different situations. In some cases, these words have arbitrary long palindromic prefix factors. In other cases, at the opposite, they have finitely many distinct palindromic factors.
AMS classification: 68R15.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allouche, J.-P., Shallit, J.: Automatic sequences: Theory and Applications. Cambridge University Press, Cambridge (2003)
Arnoux, P., Mauduit, C., Shiokawa, I., Tamura, J.I.: Complexity of sequences defined by billiard in the cube. Bull. Soc. Math. France 122, 1–12 (1994)
Baryshnikov, Y.: Complexity of trajectories in rectangular billiards. Comm. Math. Phys. 174, 43–56 (1995)
Berstel, J., de Luca, A.: Sturmian words, Lyndon words and trees. Theoret. Comput. Sci. 178, 171–203 (1997)
Berstel, J., Séébold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic combinatorics on words. Cambridge University Press, Cambridge (2002)
Borel, J.-P., Laubie, F.: Quelques mots sur la droite projective réelle. J. Théorie des Nombres de Bordeaux 5, 23–51 (1993)
Christoffel, E.B.: Observatio arithmetica. Annali di Matematica 6, 148–152 (1875)
Davenport, H.: The Higher Arithmetic: An Introduction to the Theory of Numbers, 7th edn. Cambridge Univ. Press, Cambridge (1999)
de Luca, A.: Sturmian words: structure, combinatorics, and their arithmetics. Theoret. Comput. Sci. 183, 45–82 (1997)
de Luca, A.: Combinatorics of standard sturmian words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 249–267. Springer, Heidelberg (1997)
Droubay, X.: Palindromes in the Fibonacci word. Inf. Proc. Letters 55, 217–221 (1995)
Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoret. Comput. Sci. 223, 73–85 (1999)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)
Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Clarendon Press, Oxford (1979)
Klein, F.: Ausgewählte Kapitel der Zahlentheorie. Teubner, Liepzig (1907)
Pirillo, G.: A new characteristic property of the palindrome prefixes of a standard Sturmian word, Sém. Lotharingien Combinatoire 43 (1999), electronic, see http://www.mat.univie.ac.at/~slc/
Pytheas Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics. In: Kirchner, H. (ed.) FroCos 2000. LNCS, vol. 1794. Springer, Heidelberg (2000)
Rockett, M., Szüsz, P.: Continued Fractions. World Scientific Pub. Co., Singapore (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borel, JP., Reutenauer, C. (2005). Some New Results on Palindromic Factors of Billiard Words. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_16
Download citation
DOI: https://doi.org/10.1007/11505877_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)