On stateless multihead automata: hierarchies and the emptiness problem

Authors:
Oscar H. Ibarra;Juhani Karhumäki;Alexander Okhotin
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Mathematics, University of Turku, Turku, Finland;Department of Mathematics, University of Turku, Turku, Finland and Academy of Finland
Venue:
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Year:
2008

Citing 5
Cited 8

k + 1 Heads Are Better than k

Journal of the ACM (JACM)
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
On multi-head finite automata

IBM Journal of Research and Development
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Hierarchies and Characterizations of Stateless Multicounter Machines

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Stateless Multicounter Machines

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On decision problems for parameterized machines

Theoretical Computer Science
Hierarchy results on stateless multicounter 5′ → 3′ Watson-Crick automata

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
A Survey of Results on Stateless Multicounter Automata

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition moves each head one cell left or right, or instructs it to stay. We show that stateless (k +4)-head two-way automata are more powerful than stateless k-head two-way automata. In the one-way case, we prove a tighter result: stateless (k + 1)-head one-way automata are more powerful than stateless k-head one-way automata. Finally, we show that the emptiness problem for stateless 2-head two-way automata is undecidable.