Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems

Abstract It is shown that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system iff it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and also matches a natural logic. The proof is based on the Ehrenfeucht–Fraisse technique for first-order logic and an implementation of “threshold counting” within tiling systems.

[1]  Wolfgang Thomas,et al.  NONDETERMINISM VERSUS DETERMINISM OF FINITE AUTOMATA OVER DIRECTED ACYCLIC GRAPHS , 1994 .

[2]  Wolfgang Thomas.  On Logics, Tilings, and Automata , 1991, ICALP.

[3]  Katsushi Inoue,et al.  Cyclic closure properties of automata on a two-dimensional tape , 1978, Inf. Sci..

[4]  Max Dauchet,et al.  A Kleene Theorem for a Class of Planar Acyclic Graphs , 1995, Inf. Comput..

[5]  Jörg Flum,et al.  Mathematical logic (2. ed.) , 1994, Undergraduate texts in mathematics.

[6]  Katsushi Inoue,et al.  Some properties of two-dimensional on-line tessellation acceptors , 1977, Inf. Sci..

[7]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[8]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[9]  Katsushi Inoue,et al.  A survey of two-dimensional automata theory , 1991, Inf. Sci..

[10]  M. Blum,et al.  Automata on a 2-Dimensional Tape , 1967, SWAT.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Ronald Fagin,et al.  On monadic NP vs. monadic co-NP , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[13]  Katsushi Inoue,et al.  A Characterization of Recognizable Picture Languages , 1992, ICPIA.

[14]  Antonio Restivo,et al.  Recognizable Picture Languages , 1992, Int. J. Pattern Recognit. Artif. Intell..

[15]  Katsushi Inoue,et al.  Nonclosure Properties of Two-Dimensional On-Line Tessellation Acceptors and One Way Parallel Sequential Array Acceptors , 1977 .

[16]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[17]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..