@article{ITA_1993__27_1_23_0, author = {Caucal, Didier}, title = {A fast algorithm to decide on the equivalence of stateless {DPDA}}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {23--48}, publisher = {EDP-Sciences}, volume = {27}, number = {1}, year = {1993}, mrnumber = {1213419}, zbl = {0778.68051}, language = {en}, url = {http://www.numdam.org/item/ITA_1993__27_1_23_0/} }
TY - JOUR AU - Caucal, Didier TI - A fast algorithm to decide on the equivalence of stateless DPDA JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1993 SP - 23 EP - 48 VL - 27 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1993__27_1_23_0/ LA - en ID - ITA_1993__27_1_23_0 ER -
%0 Journal Article %A Caucal, Didier %T A fast algorithm to decide on the equivalence of stateless DPDA %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1993 %P 23-48 %V 27 %N 1 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1993__27_1_23_0/ %G en %F ITA_1993__27_1_23_0
Caucal, Didier. A fast algorithm to decide on the equivalence of stateless DPDA. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 27 (1993) no. 1, pp. 23-48. http://www.numdam.org/item/ITA_1993__27_1_23_0/
1. Décidabilité de l'égalité des langages algébriques infinitaires simples, L.N.CS., Vol. 210, 1986, pp. 37-48. | MR | Zbl
,2. A Fast Algorithm to Decide on Simple Grammars Equivalence, L.N.C.S., Vol. 401 1989, pp. 66-85. | MR | Zbl
,3. An Axiomatic Approach to the KH Algorithms, Math. Systems Theory, Vol. 16, 1983, pp. 191-231. | MR | Zbl
,4. Completeness Result for the Equivalence of Recursive Schemes, J.C.S.S., Vol. 12, 1976, pp. 179-197. | MR | Zbl
and ,5. Introduction to Formal Language Theory, Addison-Wesley, 1978. | MR | Zbl
,6. On Equivalence of Grammars Through Transformation Trees, T.C.S.,Vol. 9, 1979, pp. 191-231. | MR | Zbl
, and ,7. Simple Deterministic Languages, Seventh annual I.E.E.E. switching and automata theory conference, 1966, pp. 36-46
and ,8. A Direct Algorithm for Checking Equivalence of LL(k) Grammars, T.C.S., Vol. 4, 1977, pp. 321-349. | MR | Zbl
and ,9. The Decidability of Equivalence for Deterministic Stateless Pushdown Automata, Information and Control, Vol. 38, 1978, pp. 367-376. | MR | Zbl
and ,10. An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata, T.C.S., Vol. 32, 1984, pp. 87-120 | MR | Zbl
,11. The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata, Information and Control, Vol. 25, 1974, pp. 123-153. | MR | Zbl
,12. Deterministic One-Counter Automata, J.C.S.S., Vol. 10, 1975, pp. 340-350. | MR | Zbl
and ,