Abstract
Boundary points between decidability and undecidability of various decision questions concerning two-way sequential transducers and checking automata are investigated. The results show how some unsolvable problems become solvable when certain restrictions (e.g., the machines being deterministic, reversal-bounded, etc.) are imposed. A solution to an open problem concerning cascade products of pushdown automata is also given.
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.
