1. Higuchi, K., Tomita, E., Wakatsuki, M.: A polynomial-time algorithm for checking the inclusion for strict deterministic restricted one-counter automata. IEICE Trans. Inf. & Syst. E78-D(4), 305–313 (1995)
2. Higuchi, K., Wakatsuki, M., Tomita, E.: A polynomial-time algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by final state. IEICE Trans. Inf. & Syst. E78-D(8), 939–950 (1995)
3. Sénizergues, G.: L(A)=L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251(1-2), 1–166 (2001)
4. Tajima, Y., Tomita, E., Wakatsuki, M., Terada, M.: Polynomial time learning of simple deterministic languages via queries and a representative sample. Theoret. Comput. Sci. 329, 203–221 (2004)
5. Tomita, E.: A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata. Inform. Control 52, 187–238 (1982)