Ogden's Lemma for Regular Tree Languages

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.

Keywords

Computational Complexity, F.4.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/172265

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0810.4249
 http://arxiv.org/abs/0810.4249

Collections

arXiv