Abstract

We prove that every regular language is recognized by a deterministic two-way finite automaton whose control unit is strictly locally testing. Similarly, every picture language which can be described by a regular language can actually be described by a strictly locally testable language; this strengthens a result of Friedhelra Hinz.

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 call

Disclaimer: 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.