Abstract

This paper deals with finite automata augmented with markers which the automata can move about on their input tapes. The concept of augmenting markers to automata was first introduced by Blum and Hewitt [1] in two-dimensional automata. Kreider, Ritchie, and Springsteel [6, 7, 8, 12] investigated recognition of context-free languages by (one-dimensional) automata with markers. In this paper, we investigate some fundamental properties of marker automata and study their relationships to other types of automata and languages. The main result in this paper is the establishment of an infinite hierarchy of languages recognizable by deterministic and deterministic, halting marker automata. It also turns out that, because of the equivalence of finite marker automata and multi-head automata, the study of three-marker automata becomes very interesting due to results of Hartmanis [4] and Savitch [10].

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.