Pushdown automata on arrays

Abstract This paper deals with some properties of pushdown automata (PDAs) on two-dimensional arrays. In particular, it is shown that there exists a deterministic array-bounded PDA which can traverse any simply connected pattern and halt when the traversal is complete.

[1]  Anupam N. Shah.  Pebble automata on arrays , 1974, Comput. Graph. Image Process..

[2]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.