An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs

Authors:
Ryo Yoshinaka
Affiliations:
Hokkaido University,
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 5
Cited 0

Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem

Journal of the ACM (JACM)
The inclusion problem for some subclasses of context-free languages

Theoretical Computer Science
Polynomial-time identification of very simple grammars from positive data

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Complexity results on balanced context-free languages

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Polynomial-time identification of an extension of very simple grammars from positive data

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Quantified Score

Hi-index	0.00

Visualization

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.