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

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

2009-06-17

arxiv.org/abs/0906.3051v1

EPTCS 1, 2009, pp. 93-107

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.1.9

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, finiteness, 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.

Affiliated with

Also associated with

No associations

Rating

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multi-Head Finite Automata: Characterizations, Concepts and Open Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-Head Finite Automata: Characterizations, Concepts and Open Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222140