A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing - page 139

4. Tajima, Y., Tomita, E., Wakatsuki, M., Terada, M.: Polynomial time learning of sim-
ple 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)
6. Tomita, E., Seino, K.: A direct branching algorithm for checking the equivalence of two
deterministic pushdown transducers, one of which is real-time strict. Theoret. Comput.
Sci. 64, 39-53 (1989)
7. Tomita, E., Seino, K.: The extended equivalence problem for a class of non-real-time
deterministic pushdown automata. Acta Informatica 32, 395-413 (1995)
8. Valiant, L.G.: Decision Procedures for Families of Deterministic Pushdown Automata.
Ph.D. Thesis., Report No.7, University of Warwick Computer Centre (1973)
9. Valiant, L.G., Paterson, M.S.: Deterministic one-counter automata. J. Comput. System
Sci. 10, 340-350 (1975)
10. Wakatsuki, M., Tomita, E., Nishino, T.: A polynomial-time algorithm for checking the
equivalence for real-time deterministic restricted one-counter transducers which accept
by final state. In: Proceedings of the 14th IEEE/ACIS International Conference on SNPD
2013, pp. 459-465 (2013)