Abstract
Consider the emptiness problem for deterministic two-way finite-state automata that are augmented by a bounded-reversal counter and the equivalence problem for deterministic two-way finite-state transducers. The first problem was posed by Ibarra while the second problem restricted to the case that accepting configurations are also halting configurations was posed by Ehrich and Yau. Recently the first problem restricted to devices that accept only bounded languages as well as the restricted version of the second problem have been shown decidable. Here these two problems are shown decidable also in their general form.
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.
