Abstract
The equivalence problem for the class of one-way deterministic 2-tape finite state acceptors is the problem of deciding “$L(M_1 ) = L(M_2 )$”, where $M_1 $ and $M_2 $ are machines in this class. A new algorithm for deciding equivalence is provided, having time complexity proportional to $p(n)$, where p is a polynomial and n is the size of the machines. This improves upon the best previously known upper bound having order $2^{cn^6 } $, where c is a constant [C. Beeri, Theoret. Comput. Sci., 3 (1976), pp. 305–320].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
