A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State
暂无分享,去创建一个
[1] Etsuji Tomita,et al. The extended equivalence problem for a class of non-real-time deterministic pushdown automata , 2005, Acta Informatica.
[2] Ken Higuchi,et al. A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata , 1995, IEICE Trans. Inf. Syst..
[3] Ken Higuchi,et al. A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode , 1998 .
[4] Leslie G. Valiant,et al. Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..
[5] Ken Higuchi,et al. A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State , 1995, IEICE Trans. Inf. Syst..
[6] Géraud Sénizergues,et al. L(A) = L(B) ? decidability results from complete formal systems , 2001 .
[7] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[8] Leslie G. Valiant,et al. Decision procedures for families of deterministic pushdown automata , 1973 .
[9] Etsuji Tomita. A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata , 1982, Inf. Control..
[10] Yasuhiro Tajima,et al. Polynomial time learning of simple deterministic languages via queries and a representative sample , 2004, Theor. Comput. Sci..
[11] Etsuji TOMITA,et al. A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict , 1989, Theor. Comput. Sci..