An efficient algorithm for the inclusion problem of a subclass of DPDAs

研究成果: Conference contribution

抄録

This paper presents an efficient algorithm solving the inclusion problem of a new subclass of context-free languages. The languages are accepted by the special kind of real-time deterministic pushdown automata, called strongly forward-deterministic pushdown automata, that go to the same state and push the same sequence of stack symbols whenever transition is allowed on the same input symbol. Our algorithm can be applied to efficient identification in the limit of that class from positive data.

本文言語English
ホスト出版物のタイトルLanguage and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers
ページ487-498
ページ数12
DOI
出版ステータスPublished - 2008
外部発表はい
イベント2nd International Conference on Language and Automata Theory and Applications, LATA 2008 - Tarragona, Spain
継続期間: 2008 3 132008 3 19

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5196 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other2nd International Conference on Language and Automata Theory and Applications, LATA 2008
国/地域Spain
CityTarragona
Period08/3/1308/3/19

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An efficient algorithm for the inclusion problem of a subclass of DPDAs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル