Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

Markus Holzer, Martin Kutrib, Andreas Malcher
<span title="2009-06-25">2009</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been developed. Although multi-head finite automata are a simple concept, their computational behavior can be already very complex and leads to undecidable or even non-semi-decidable problems on these devices such as, for example, emptiness,
more &raquo; ... s, universality, equivalence, etc. These strong negative results trigger the study of subclasses and alternative characterizations of multi-head finite automata for a better understanding of the nature of non-recursive trade-offs and, thus, the borderline between decidable and undecidable problems. In the present paper, we tour a fragment of this literature.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.4204/eptcs.1.9</a> <a target="_blank" rel="external noopener" href="">fatcat:gdxlz36uczhghkxhtxhiatw2ja</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / </button> </a>