We are introducing and discussing finite automata working on rectangular-shaped arrays
(ie, pictures) in a boustrophedon reading mode. We prove close relationships with the well …

Recognizable two-dimensional languages (REC) are defined by tiling systems that
generalize to two dimensions non-deterministic finite automata for strings. We introduce the …

Formal language theory originated in the 1950s as an abstract model of natural language,
which is, of course, a time-ordered sequence, but quite soon attempts were made to apply …

Abstract Automata theory is the study of abstract machines. It is a theory in theoretical
computer science and discrete mathematics (a subject of study in mathematics and …

The aim of this paper is to collect definitions and results on the main classes of 2D
languages introduced with the attempt of generalizing regular and context-free string …

Deterministic recognizability of picture languages with Wang automata Page 1 Discrete
Mathematics and Theoretical Computer Science DMTCS vol. 12:4, 2010, 73–94 Deterministic …

We introduce a model of automaton for picture language recognition which is based on tiles
and is called Wang automaton, since its description relies on the notation of Wang systems …

Wang automata are devices for picture language recognition recently introduced by us,
which characterize the class REC of recognizable picture languages. Thus, Wang automata …

We introduce the definition of string language S recognized via picture language P and
prove that there is a one-to-one correspondence between a linear bounded automaton …

The paper deals with some classes of two-dimensional recognizable languages of “high
complexity”, in a sense specified in the paper and motivated by some necessary conditions …