Simulating one-reversal multicounter machines by partially blind multihead finite automata

Authors:
Alan Deckelbaum
Affiliations:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Venue:
Theoretical Computer Science
Year:
2008

Citing 3
Cited 0

Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
On partially blind multihead finite automata

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

This work is concerned with simulating nondeterministic one-reversal multicounter automata (NCMs) by nondeterministic partially blind multihead finite automata (NFAs). We show that any one-reversal NCM with k counters can be simulated by a partially blind NFA with k blind heads. This provides a nearly complete categorization of the computational power of partially blind automata, showing that the power of a (k+1)-NFA lies between that of a k-NCM and a (k+1)-NCM.