Two-dimensional input-revolving automata

Abstract

A new type of two-dimensional automaton for accepting two-dimensional languages, called as two-dimensional input-revolving automaton is introduced in this paper. It is an extension of input-revolving automaton for string languages. We bring out all the variants of this automaton which are based on the various types of column-revolving operations considered here. We compare the families of array languages accepted by the variants of these automata along with the well known families of Siromoney matrix languages. We discuss some of the closure properties of the new families of array languages and give an application in steganography.