Abstract
A sweeping automaton is a deterministic two-way finite automaton which only changes head direction at the ends of the input tape. It is shown that for every n, there is a language which is accepted by an n-state nondeterministic one-way finite automaton, yet which is not accepted by any sweeping automaton with fewer than 2 n states.
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.
