Descriptive complexity for pictures languages

Authors Etienne Grandjean, Frédéric Olive

Thumbnail PDF


  • Filesize: 498 kB
  • 15 pages

Document Identifiers

Author Details

Etienne Grandjean
Frédéric Olive

Cite AsGet BibTex

Etienne Grandjean and Frédéric Olive. Descriptive complexity for pictures languages. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 274-288, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


This paper deals with logical characterizations of picture languages of any dimension by syntactical fragments of existential second-order logic. Two classical classes of picture languages are studied: - the class of "recognizable" picture languages, i.e. projections of languages defined by local constraints (or tilings): it is known as the most robust class extending the class of regular languages to any dimension; - the class of picture languages recognized on "nondeterministic cellular automata in linear time" : cellular automata are the simplest and most natural model of parallel computation and linear time is the minimal time-bounded class allowing synchronization of nondeterministic cellular automata. We uniformly generalize to any dimension the characterization by Giammarresi et al. (1996) of the class of "recognizable" picture languages in existential monadic second-order logic. We state several logical characterizations of the class of picture languages recognized in linear time on nondeterministic cellular automata. They are the first machine-independent characterizations of complexity classes of cellular automata. Our characterizations are essentially deduced from normalization results we prove for first-order and existential second-order logics over pictures. They are obtained in a general and uniform framework that allows to extend them to other "regular" structures.
  • Picture languages
  • locality and tiling
  • recognizability
  • linear time
  • cellular automata
  • logical characterizations
  • second-order logic


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads