Abstract
A new direct algorithm is presented for checking equivalence of some classes of deterministic pushdown automata (dpda's), after Korenjak and Hopcroft's branching algorithm. It is not only powerful enough to be applicable to two dpda's accepting by empty stack, one of which is real-time, but also simple even for dpda's in lower subclasses. This is the first time the branching algorithm has been used to give such a general decision procedure without ever “mixing” the two languages in question. In other words, it deals with only the equivalence equation whose left-hand side consists of a pure reachable configuration of one dpda and whose right-hand side that of the other.
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.
