Abstract
This paper extends the direct branching algorithm of [25] for checking equivalence of deterministic pushdown automata. It does so by providing a technique called ‘halting’ for dealing with nodes with unbounded degree in the comparison tree. This may occur when a skipping step may be applied infinitely many times to a certain node, as a result of infinite sequences of ε-moves. This extension allows the algorithm to check equivalence of two deterministic pushdown automata when none of them is real-time, but in a certain condition that properly contains a case where one of them is real-time strict.
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.
