Advertisement

A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State

  • Mitsuo WakatsukiEmail author
  • Etsuji Tomita
  • Tetsuro Nishino
Part of the Studies in Computational Intelligence book series (SCI, volume 569)

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.

Keywords

formal language theory equivalence problem deterministic pushdown transducer deterministic restricted one-counter transducer polynomial-time algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)Google Scholar
  2. 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)Google Scholar
  3. 3.
    Sénizergues, G.: L(A)=L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251(1-2), 1–166 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Tomita, E.: A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata. Inform. Control 52, 187–238 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Valiant, L.G.: Decision Procedures for Families of Deterministic Pushdown Automata. Ph.D. Thesis., Report No.7, University of Warwick Computer Centre (1973)Google Scholar
  9. 9.
    Valiant, L.G., Paterson, M.S.: Deterministic one-counter automata. J. Comput. System Sci. 10, 340–350 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Mitsuo Wakatsuki
    • 1
    Email author
  • Etsuji Tomita
    • 2
  • Tetsuro Nishino
    • 1
  1. 1.Graduate School of Informatics and EngineeringThe University of, Electro-CommunicationsChofuJapan
  2. 2.The Advanced Algorithms Research LaboratoryThe University of Electro-CommunicationsChofuJapan

Personalised recommendations