Author:
Carpi Arturo,de Luca Aldo
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Allouche, J.-P., Shallit, J.: Automatic Sequences. Cambridge University Press, Cambridge (2003)
2. Berstel, J., de Luca, A.: Sturmian words, Lyndon words and trees. Theoretical Computer Science 178, 171–203 (1997)
3. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)
4. Berstel, J., Séébold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, pp. 45–110. Cambridge University Press, Cambridge (2002)
5. Borel, J.P., Reutenauer, C.: Palindromic factors of billiard words. Theoretical Computer Science (to appear)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Inequality for the Number of Periods in a Word;International Journal of Foundations of Computer Science;2021-06-21
2. A Characterization of Bispecial Sturmian Words;Mathematical Foundations of Computer Science 2012;2012
3. A Classification of Trapezoidal Words;Electronic Proceedings in Theoretical Computer Science;2011-08-17