A Survey of Results on Stateless Multicounter Automata

Authors:
Oscar H. Ibarra;Ömer Eğecioğlu
Affiliations:
(Correspd.) (Research supported in part by NSF Grants CCF-1143892 and CCF-1117708) Department of Computer Science, University of California, Santa Barbara, CA 93106, USA, ibarra@cs.ucsb.edu;Department of Computer Science, University of California, Santa Barbara, CA 93106, USA, omer@cs.ucsb.edu
Venue:
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Year:
2012

Citing 11
Cited 0

Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Computing with membranes

Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
On Stateless Multihead Finite Automata and Multihead Pushdown Automata

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
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 stateless multihead automata: hierarchies and the emptiness problem

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A stateless multicounter machine has m-counters operating on a one-way input delimited by left and right end markers. A move of the machine depends only on the symbol under the input head and the sign pattern of the counters. An input string is accepted if, when the input head is started on the left end marker with all counters zero, the machine eventually reaches the configuration where the input head is on the right end marker with all the counters again zero. We bring together a number of results on stateless multicounter automata of various different types: deterministic, nondeterministic, realtime (the input head moves right at every step), or non-realtime. We investigate realtime and non-realtime machines in both deterministic and nondeterministic cases with respect to the number of counters and reversals. In addition to hierarchy results, we also consider closure properties and the connections to stateless multihead automata.