Ogden's Lemma for Regular Tree Languages

Simple item page
dc.creatorKuhlmann, Marco
dc.date2008-10-23
dc.date.accessioned2026-07-07T10:12:41Z
dc.date.available2026-07-07T10:12:41Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0810.4249
dc.identifierhttp://arxiv.org/abs/0810.4249
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172265
dc.subjectComputational Complexity
dc.subjectF.4.3
dc.titleOgden's Lemma for Regular Tree Languages
dc.typetext

Files

Collections

arXiv