Abstract
This paper is concerned with a subclass of deterministic pushdown transducers, called deterministic restricted one-counter transducers (droct’s), and studies the equivalence problem for droct’s which accept by final state. In the previous study, we presented a polynomial-time algorithm for checking the equivalence of real-time droct’s. By extending the technique, we present a polynomial-time algorithm for checking the equivalence of non-real-time droct’s.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
Sénizergues, G.: L(A)=L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251(1-2), 1–166 (2001)
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)
Tomita, E.: A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata. Inform. Control 52, 187–238 (1982)
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)
Tomita, E., Seino, K.: The extended equivalence problem for a class of non-real-time deterministic pushdown automata. Acta Informatica 32, 395–413 (1995)
Valiant, L.G.: Decision Procedures for Families of Deterministic Pushdown Automata. Ph.D. Thesis., Report No.7, University of Warwick Computer Centre (1973)
Valiant, L.G., Paterson, M.S.: Deterministic one-counter automata. J. Comput. System Sci. 10, 340–350 (1975)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Wakatsuki, M., Tomita, E., Nishino, T. (2015). A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State. In: Lee, R. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing. Studies in Computational Intelligence, vol 569. Springer, Cham. https://doi.org/10.1007/978-3-319-10389-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-10389-1_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10388-4
Online ISBN: 978-3-319-10389-1
eBook Packages: EngineeringEngineering (R0)