Two-dimensional jumping finite automata

In this paper, we extend a newly introduced concept called the jumping nite automata for accepting string languages to two-dimensional jumping nite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable picture languages (REC). We also discuss some of the closure properties of these automata along with some of their decidability properties