On partially blind multihead finite automata

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.

[1]  Bala Ravikumar.  Some Observations on 2-way Probabilistic Finite Automata , 1992, FSTTCS.

[2]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[3]  Cynthia Dwork,et al.  On the power of 2-way probabilistic finite state automata , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Oscar H. Ibarra.  The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications , 1978, SIAM J. Comput..

[5]  Sheila A. Greibach.  Remarks on the Complexity of Nondeterministic Counter Languages , 1976, Theor. Comput. Sci..

[6]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

[7]  Rajeev Alur,et al.  Model checking of hierarchical state machines , 1998, TOPL.

[8]  Oscar H. Ibarra,et al.  Real-Counter Automata and Their Decision Problems , 2004, FSTTCS.

[9]  Oscar H. Ibarra,et al.  A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata , 1974, Inf. Process. Lett..

[10]  Oscar H. Ibarra,et al.  Multi-Tape and Multi-Head Pushdown Automata , 1968, Inf. Control..

[11]  Birgit Jenner.  Knapsack Problems for NL , 1995, Inf. Process. Lett..

[12]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[13]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[14]  Ivan Hal Sudborough,et al.  A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.

[15]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[16]  R. J. Nelson,et al.  Introduction to Automata , 1968 .

[17]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[18]  Dung T. Huynh,et al.  On a Complexity Hierarchy Between L and NL , 1988, Inf. Process. Lett..

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .