Abstract
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words, Sturmian trees are irrational trees of minimal complexity. We give various examples of Sturmian trees, and we characterize one family of Sturmian trees by means of a structural property of their automata.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carpi, A., de Luca, A., Varricchio, S.: Special factors and uniqueness conditions in rational trees. Theory of Computing Systems 34, 375–395 (2001)
Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–165 (1983)
Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Mathematical Systems Theory 7, 138–153 (1973)
Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics, vol. 90. Cambridge University Press, Cambridge (2002)
Pytheas-Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics (Edited by Berthé, V., et al). Lecture Notes in Mathematics, vol. 1794. Springer, Heidelberg (2002)
Sakarovitch, J.: Élements de théorie des automates. Vuibert, Paris (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Berstel, J., Boasson, L., Carton, O., Fagnot, I. (2007). A First Investigation of Sturmian Trees. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)