Descriptive complexity for pictures languages

Etienne Grandjean 1, * Frédéric Olive 2
* Corresponding author
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Etienne Grandjean <>
Submitted on : Tuesday, January 22, 2013 - 6:44:00 PM
Last modification on : Tuesday, April 2, 2019 - 1:33:26 AM
Long-term archiving on : Saturday, April 1, 2017 - 8:24:09 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00779971, version 1


Etienne Grandjean, Frédéric Olive. Descriptive complexity for pictures languages. Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, Sep 2012, Fontainebleau, France. pp.1-15. ⟨hal-00779971⟩



Record views


Files downloads