Infinite triangular arrays and recognizability

In this paper the concept of local languages is extended to infinite triangular arrays and ωω local languages are defined. ωω-recognizable languages of infinite triangular arrays accepted by two direction online tesselation automata are considered. Properties of these languages are studied. Mathematics Subject Classification: 68Q