Hierarchies and Characterizations of Stateless Multicounter Machines

Authors:
Oscar H. Ibarra;Ömer Eğecioğlu
Affiliations:
Department of Computer Science, University of California, Santa Barbara, USA 93106;Department of Computer Science, University of California, Santa Barbara, USA 93106
Venue:
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Year:
2009

Citing 6
Cited 8

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 automata: hierarchies and the emptiness problem

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

On Stateless Multicounter Machines

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
One-reversal counter machines and multihead automata: revisited

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of 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
One-reversal counter machines and multihead automata: Revisited

Theoretical Computer Science
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
Automata with modulo counters and nondeterministic counter bounds

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the computing power of stateless multi- counter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the input head moves right at every step), or non-realtime. The deterministic realtime stateless multicounter machines has been studied elsewhere [1]. Here we investigate non-realtime machines in both deterministic and nondeterministic cases with respect to the number of counters and reversals. We also consider closure properties and relate the models to stateless multihead automata and show that the bounded languages accepted correspond exactly to semilinear sets.