On word and frontier languages of unsafe higher-order grammars

Kazuyuki Asada, Naoki Kobayashi

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

Higher-order grammars are an extension of regular and context-free grammars, where nonterminals may take parameters. They have been extensively studied in 1980's, and restudied recently in the context of model checking and program verification. We show that the class of unsafe order-(n+1) word languages coincides with the class of frontier languages of unsafe order-n tree languages. We use intersection types for transforming an order-(n+1) word grammar to a corresponding order-n tree grammar. The result has been proved for safe languages by Damm in 1982, but it has been open for unsafe languages, to our knowledge. Various known results on higher-order grammars can be obtained as almost immediate corollaries of our result.

本文言語English
ホスト出版物のタイトル43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
編集者Yuval Rabani, Ioannis Chatzigiannakis, Davide Sangiorgi, Michael Mitzenmacher
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770132
DOI
出版ステータスPublished - 2016 8月 1
外部発表はい
イベント43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 - Rome, Italy
継続期間: 2016 7月 122016 7月 15

出版物シリーズ

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

Conference

Conference43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
国/地域Italy
CityRome
Period16/7/1216/7/15

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

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

引用スタイル