Homing vector automata

We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept the input. The computational power of the deterministic, nondeterministic and blind versions of these real-time machines are examined and compared to various related types of automata. A generalized version of the Stern-Brocot encoding method, suitable for representing strings on arbitrary alphabets, is also developed.

[1]  Richard J. Lipton,et al.  Quantum Algorithms via Linear Algebra: A Primer , 2014 .

[2]  M. Stern.  Ueber eine zahlentheoretische Funktion. , 1858 .

[3]  A. C. Cem Say,et al.  Real-Time Vector Automata , 2013, FCT.

[4]  Victor Mitrana,et al.  Extended finite automata over groups , 2001, Discret. Appl. Math..

[5]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[6]  Journal für die reine und angewandte Mathematik , 1893 .

[7]  M. I. Kargapolov,et al.  Fundamentals of the theory of groups , 1979 .

[8]  Jon M. Corson.  Extended Finite Automata and Word Problems , 2005, Int. J. Algebra Comput..

[9]  Thomas Garrity,et al.  A Multidimensional Continued Fraction Generalization of Stern's Diatomic Sequence , 2012, 1206.6685.

[10]  Oscar H. Ibarra,et al.  Finite Automata with Multiplication , 1976, Theor. Comput. Sci..

[11]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[12]  Victor Mitrana,et al.  Finite Automata over Free Groups , 2000, Int. J. Algebra Comput..

[13]  Arnold L. Rosenberg,et al.  Real Time Counter Machines (Preliminary Version) , 1967, SWAT.

[14]  Arnold L. Rosenberg,et al.  Counter machines and counter languages , 1968, Mathematical systems theory.

[15]  Charles F. Miller,et al.  Combinatorial Group Theory , 2002 .

[16]  Victor Mitrana,et al.  The Accepting Power of Finite Automata over Groups , 1997, New Trends in Formal Languages.

[17]  Michio Oyamaguchi,et al.  The Equivalence Problem for Real-Time Strict Deterministic Languages , 1980, Inf. Control..

[18]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[19]  Mark Kambites,et al.  Formal Languages and Groups as Memory , 2006, math/0601061.

[20]  Holger Petersen.  Simulations by Time-Bounded Counter Machines , 2009, Developments in Language Theory.

[21]  Paavo Turakainen,et al.  Generalized automata and stochastic languages , 1969 .

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