arXiv Open Access 2008

Ogden's Lemma for Regular Tree Languages

Marco Kuhlmann

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (1)

Marco Kuhlmann

Format Sitasi

APA MLA BibTeX

Kuhlmann, M. (2008). Ogden's Lemma for Regular Tree Languages. https://arxiv.org/abs/0810.4249

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2008
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓