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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers
Pages487-498
Number of pages12
DOIs
Publication statusPublished - 2008 Nov 26
Externally publishedYes
Event2nd International Conference on Language and Automata Theory and Applications, LATA 2008 - Tarragona, Spain
Duration: 2008 Mar 132008 Mar 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5196 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Language and Automata Theory and Applications, LATA 2008
CountrySpain
CityTarragona
Period08/3/1308/3/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An efficient algorithm for the inclusion problem of a subclass of DPDAs'. Together they form a unique fingerprint.

  • Cite this

    Yoshinaka, R. (2008). An efficient algorithm for the inclusion problem of a subclass of DPDAs. In Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers (pp. 487-498). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5196 LNCS). https://doi.org/10.1007/978-3-540-88282-4_44