Skip to Main content Skip to Navigation
Conference papers

Descriptive complexity for pictures languages (extended abstract)

Etienne Grandjean 1 Frédéric Olive 2 Gaétan Richard 1 
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic.- We uniformly generalize to any dimension the characterization by Giammarresi et al. \cite{GRST96} of the class of \emph{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 of any dimension. 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. Finally, we describe some hierarchy results that show the optimality of our logical characterizations and delineate their limits.
Complete list of metadata
Contributor : Greyc Référent Connect in order to contact the contributor
Submitted on : Friday, November 21, 2014 - 2:14:53 PM
Last modification on : Saturday, June 25, 2022 - 9:49:29 AM

Links full text


  • HAL Id : hal-01085892, version 1
  • ARXIV : 1201.5853


Etienne Grandjean, Frédéric Olive, Gaétan Richard. Descriptive complexity for pictures languages (extended abstract). Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on, Jun 2012, Dubrovnik, Croatia. ⟨hal-01085892⟩



Record views