On the Computation Power of Finite Automata in Two-dimensional Environments

In this paper we study the model of a finite state automaton interacting with infinite two-dimensional geometric environments. We show that the reachability problem for a finite state automaton interacting with a quadrant of the plane extended by a power function, a polynomial function or a linear function is algorithmically undecidable, by simulating a Minsky machine. We also consider the environment defined by a parabola which impedes the direct simulation of multiplication. However we show that the model of a finite automaton interacting inside a parabola is also universal.

[1]  Maurice Margenstern,et al.  Frontier between decidability and undecidability: a survey , 2000, Theor. Comput. Sci..

[2]  A. N. Kurganskii.  Indistinguishability of Finite-State Automata with Respect to Some Environments , 2001 .

[3]  Dora Giammarresi.  Finite State Recognizability for Two-Dimensional Languages: A Brief Survey , 1995, Developments in Language Theory.

[4]  I. S. Grunskii,et al.  Indistinguishability of finite automata with constrained behavior , 1996 .

[5]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[6]  V. A. Litvinov,et al.  A method for improving the efficiency of external sorting algorithms using the distribution method , 1969 .

[7]  Igor Potapov,et al.  On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels , 1999 .

[8]  M. Blum,et al.  Automata on a 2-Dimensional Tape , 1967, SWAT.

[9]  Matthias Jantzen,et al.  Refining the hierarchy of blind multicounter languages and twist-closed trios , 2003, Inf. Comput..

[10]  Jarkko Kari,et al.  New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata , 2001, STACS.

[11]  Katsushi Inoue,et al.  A survey of two-dimensional automata theory , 1991, Inf. Sci..

[12]  G. Kilibarda,et al.  On behaviour of automata in labyrinths , 1993 .

[13]  G. Kilibarda,et al.  Collectives of automata in labyrinths , 2003 .

[14]  Katsushi Inoue,et al.  Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata , 1999, Int. J. Pattern Recognit. Artif. Intell..