On partially blind multihead finite automata

Authors:
Oscar H. Ibarra;Bala Ravikumar
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, Sonoma State University, Rohnert Park, CA
Venue:
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Year:
2006

Citing 9
Cited 5

On a complexity hierarchy between L and NL

Information Processing Letters
Knapsack problems for NL

Information Processing Letters
Model checking of hierarchical state machines

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
Some Observations on 2-way Probabilistic Finite Automata

Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Real-Counter automata and their decision problems

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

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

Theoretical Computer Science
On the descriptional complexity of Watson-Crick automata

Theoretical Computer Science
On the universe, disjointness, and containment problems for simple machines

Information and Computation
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
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

This work is concerned with 1-way multihead finite automata (FA), both deterministic and nondeterministic, in which the symbol under only one head controls its move. We call such a FA a partially blind multihead FA. We show some results regarding the decision problems and closure properties of blind multihead DFA and NFA. We also compare these devices with 1-way NFA augmented by reversal bounded counters. Finally, we also present some results regarding the simulation of a partially blind DFA and NFA by a probabilistic finite automaton.