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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yoshinaka, R. (2008). An efficient algorithm for the inclusion problem of a subclass of DPDAs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5196 LNCS, pp. 487–498). https://doi.org/10.1007/978-3-540-88282-4_44
Mendeley helps you to discover research relevant for your work.