Hierarchies and Characterizations of Stateless Multicounter Machines

Abstract. We investigate the computing power of stateless multicounter 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.

• Type: Conference
• Year: 2009
• Where: COCOON
• Authors: Oscar H. Ibarra, Ömer Egecioglu
• Keywords: COCOON 2009, Combinatorics, Deterministic Realtime, Stateless Multicounter Machines, Stateless Multihead Automata