2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/62268We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the complexity has cubic asymptotic growth.12 pages, 4 figuresDynamical Systems37Ctext