论文信息 - On the Inclusion Problem for Very Simple Deterministic Pushdown Automata

On the Inclusion Problem for Very Simple Deterministic Pushdown Automata

We present a new algorithm for checking the inclusion of very simple determin-istic pushdown automata. The inclusion LM 1 LM 2 ?" is checked by rst constructing a nite characteristic set R of M 1 , and then checking whether or not the inclusion R LM 2 holds.

Erkki Mäkinen

[1] Takashi Yokomori. Polynomial-time learning of very simple grammars from positive data , 1991, COLT '91.

[2] Dana Angluin,et al. Inference of Reversible Languages , 1982, JACM.

[3] Emily P. Friedman. The Inclusion Problem for Simple Languages , 1976, Theor. Comput. Sci..

[4] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[5] Etsuji Tomita,et al. A Fast Algorithm for Checking the Inclusion for Very Simple Deterministic Pushdown Automata , 1993 .