Lambda-definable order-3 tree functions are well-quasi-ordered

Kazuyuki Asada, Naoki Kobayashi

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Asada and Kobayashi [ICALP 2017] conjectured a higher-order version of Kruskal’s tree theorem, and proved a pumping lemma for higher-order languages modulo the conjecture. The conjecture has been proved up to order-2, which implies that Asada and Kobayashi’s pumping lemma holds for order-2 tree languages, but remains open for order-3 or higher. In this paper, we prove a variation of the conjecture for order-3. This is sufficient for proving that a variation of the pumping lemma holds for order-3 tree languages (equivalently, for order-4 word languages).

本文言語English
ホスト出版物のタイトル38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018
編集者Sumit Ganguly, Paritosh Pandya
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770934
DOI
出版ステータスPublished - 2018 12
イベント38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018 - Ahmedabad, India
継続期間: 2018 12 112018 12 13

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
122
ISSN(印刷版)1868-8969

Conference

Conference38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018
国/地域India
CityAhmedabad
Period18/12/1118/12/13

ASJC Scopus subject areas

  • ソフトウェア

引用スタイル