Farey codes and languages

European Journal of Combinatorics - Tập 28 - Trang 371-402 - 2007
Arturo Carpi1,2, Aldo de Luca3,2
1Dipartimento di Matematica e Informatica dell’Università di Perugia, Via Vanvitelli 1, 06123 Perugia, Italy
2Istituto di Cibernetica del C. N. R. “E. Caianiello”, Pozzuoli (NA), Italy
3Dipartimento di Matematica e Applicazioni, Università di Napoli “Federico II”, via Cintia, Monte S. Angelo, 80126 Napoli, Italy

Tài liệu tham khảo

Allouche, 2003 Berstel, 1997, Sturmian words, Lyndon words and trees, Theoretical Computer Science, 178, 171, 10.1016/S0304-3975(96)00101-6 Berstel, 1985 Berstel, 2002, Sturmian words, 45 Carpi, 2004, Harmonic and gold Sturmian words, European Journal of Combinatorics, 25, 685, 10.1016/j.ejc.2003.10.007 Carpi, 2005, Codes of central Sturmian words, Theoretical Computer Science, 340, 220, 10.1016/j.tcs.2005.03.021 de Luca, 1997, Combinatorics of standard Sturmian words, 249 de Luca, 1997, Standard Sturmian morphisms, Theoretical Computer Science, 178, 205, 10.1016/S0304-3975(96)00054-0 de Luca, 1997, Sturmian words: structure, combinatorics, and their arithmetics, Theoretical Computer Science, 183, 45, 10.1016/S0304-3975(96)00310-6 de Luca, 1994, On some combinatorial properties of Sturmian words, Theoretical Computer Science, 136, 361, 10.1016/0304-3975(94)00035-H Edwards, 1974 Hardy, 1968 Ilie, 2000, Two-variable word equations, Theoretical Informatics and Applications, 34, 467, 10.1051/ita:2000126 Lothaire, 1983 Mignosi, 1991, On the number of factors of Sturmian words, Theoretical Computer Science, 82, 71, 10.1016/0304-3975(91)90172-X