@article{oai:ipsj.ixsq.nii.ac.jp:00016452,
 author = {NguyenVanTang and Mizuhito, Ogawa and Nguyen, VanTang and Mizuhito, Ogawa},
 issue = {1},
 journal = {情報処理学会論文誌プログラミング（PRO）},
 month = {Jun},
 note = {This paper refines the alternate stacking technique used in Greibach-Friedman's proof of the language inclusion problem L(A) ⊆ L(B)  where A is a pushdown automaton (PDA) and B is a superdeterministic pushdown automaton (SPDA). In particular  we propose a product construction of a simulating PDA M  whereas the one given by the original proof encoded everything as a stack symbol. This construction avoids the need for the “liveness” condition in the alternate stacking technique  and the correctness proof becomes simpler., This paper refines the alternate stacking technique used in Greibach-Friedman's proof of the language inclusion problem L(A) ⊆ L(B), where A is a pushdown automaton (PDA) and B is a superdeterministic pushdown automaton (SPDA). In particular, we propose a product construction of a simulating PDA M, whereas the one given by the original proof encoded everything as a stack symbol. This construction avoids the need for the “liveness” condition in the alternate stacking technique, and the correctness proof becomes simpler.},
 pages = {36--46},
 title = {Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata},
 volume = {1},
 year = {2008}
}