2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/172265We motivate and prove a strong pumping lemma for regular tree languages. The new lemma can be seen as the natural correspondent of Ogden's lemma for context-free string languages.Computational ComplexityF.4.3text