Abstract
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian words.
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
Béal, M.-P., Mignosi, F., Restivo, A.: Minimal Forbidden Words and Symbolic Dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 555–566. Springer, Heidelberg (1996)
Berstel, J., de Luca, A.: Sturmian Words, Lyndon Words and Trees. Theoret. Comput. Sci. 178(1-2), 171–203 (1997)
Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetition in Words. CRM monograph series, vol. 27. American Mathematical Society (2008)
Bucci, M., De Luca, A., Fici, G.: Enumeration and structure of trapezoidal words (submitted, 2012)
Carpi, A., de Luca, A.: Central Sturmian Words: Recent Developments. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 36–56. Springer, Heidelberg (2005)
Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Mathematical Systems Theory 7(2), 138–153 (1973)
Crochemore, M., Mignosi, F., Restivo, A.: Minimal Forbidden Words and Factor Automata. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 665–673. Springer, Heidelberg (1998)
de Luca, A.: Sturmian Words: Structure, Combinatorics, and Their Arithmetics. Theoret. Comput. Sci. 183(1), 45–82 (1997)
de Luca, A., Mignosi, F.: Some combinatorial properties of Sturmian words. Theoret. Comput. Sci. 136(2), 361–385 (1994)
Dulucq, S., Gouyou-Beauchamps, D.: Sur les Facteurs des Suites de Sturm. Theoret. Comput. Sci. 71(3), 381–400 (1990)
Fici, G.: Special Factors and the Combinatorics of Suffix and Factor Automata. Theoret. Comput. Sci. 412(29), 3604–3615 (2011)
Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Clarendon Press, Oxford (1979)
Lipatov, E.P.: A classification of binary collections and properties of homogeneity classes (Russian). Problemy Kibernet. 39, 67–84 (1982)
Mignosi, F.: On the number of factors of Sturmian words. Theoret. Comput. Sci. 82, 71–84 (1991)
Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theoret. Comput. Sci. 273(1-2), 99–117 (2002)
Morse, M., Hedlund, G.A.: Symbolic dynamics II: Sturmian Trajectories. Amer. J. Math. 62, 1–42 (1940)
Sciortino, M., Zamboni, L.Q.: Suffix Automata and Standard Sturmian Words. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 382–398. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fici, G. (2012). A Characterization of Bispecial Sturmian Words. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-32589-2_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32588-5
Online ISBN: 978-3-642-32589-2
eBook Packages: Computer ScienceComputer Science (R0)