Pumping lemma for higher-order languages

Kazuyuki Asada, Naoki Kobayashi

研究成果: Conference contribution

6 被引用数 (Scopus)

抄録

We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/indexed languages), and have been used to show that a given language does not belong to the classes of regular/context-free/indexed languages. We prove a pumping lemma for word/tree languages of arbitrary orders, modulo a conjecture that a higher-order version of Kruskal's tree theorem holds. We also show that the conjecture indeed holds for the order-2 case, which yields a pumping lemma for order-2 tree languages and order-3 word languages.

本文言語English
ホスト出版物のタイトル44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
編集者Anca Muscholl, Piotr Indyk, Fabian Kuhn, Ioannis Chatzigiannakis
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770415
DOI
出版ステータスPublished - 2017 7月 1
外部発表はい
イベント44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 - Warsaw, Poland
継続期間: 2017 7月 102017 7月 14

出版物シリーズ

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

Conference

Conference44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
国/地域Poland
CityWarsaw
Period17/7/1017/7/14

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Pumping lemma for higher-order languages」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル