References

  1. M. Bucci, A. de Luca & A. De Luca (2009): Rich and Periodic-Like Words. In: V. Diekert & D. Nowotka: Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30–July 3, 2009, Proceedings, Lecture Notes in Comput. Sci. 5583. Springer, pp. 145–155, doi:10.1007/978-3-642-02737-6_11.
  2. A. Carpi & A. de Luca (2001): Periodic-like words, periodicity and boxes. Acta Informatica 37, pp. 597–618, doi:10.1007/PL00013314.
  3. A. Carpi & A. de Luca (2005): Central Sturmian Words: Recent Developments. In: C. De Felice & A. Restivo: Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings, Lecture Notes in Comput. Sci. 3572. Springer, pp. 36–56, doi:10.1007/11505877_4.
  4. F. D'Alessandro (2002): A combinatorial problem on Trapezoidal words. Theoret. Comput. Sci. 273(1-2), pp. 11–33, doi:10.1016/S0304-3975(00)00431-X.
  5. A. Glen, J. Justin, S. Widmer & L. Q. Zamboni (2009): Palindromic richness. European J. Combin. 30, pp. 510–531, doi:10.1016/j.ejc.2008.04.006.
  6. M. Lothaire (2002): Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Cambridge Univ. Press, New York, NY, USA.
  7. A. de Luca (1999): On the combinatorics of finite words. Theoret. Comput. Sci. 218, pp. 13–39, doi:10.1016/S0304-3975(98)00248-5.
  8. A. de Luca & A. De Luca (2005): Palindromes in Sturmian Words. In: C. De Felice & A. Restivo: Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings, Lecture Notes in Comput. Sci. 3572. Springer, pp. 199–208, doi:10.1007/11505877_18.
  9. A. de Luca & A. De Luca (2006): Combinatorial properties of Sturmian palindromes. Internat. J. Found. Comput. Sci. 17(3), pp. 557–573, doi:10.1142/S0129054106003991.
  10. A. de Luca & A. De Luca (2006): Some characterizations of finite Sturmian words. Theoret. Comput. Sci. 356, pp. 118–125, doi:10.1016/j.tcs.2006.01.036.
  11. A. de Luca, A. Glen & L. Q. Zamboni (2008): Rich, Sturmian, and Trapezoidal words. Theoret. Comput. Sci. 407, pp. 569–573, doi:10.1016/j.tcs.2008.06.009.
  12. A. de Luca & F. Mignosi (1994): Some combinatorial properties of Sturmian words. Theoret. Comput. Sci. 136(2), pp. 361–385, doi:10.1016/0304-3975(94)00035-H.
  13. F. Mignosi (1991): On the number of factors of Sturmian words. Theoret. Comput. Sci. 82, pp. 71–84, doi:10.1016/0304-3975(91)90172-X.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org