Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Definability by Horn formulas and linear time on cellular automata

Nicolas Bacquey 1, 2 Etienne Grandjean 3 Frédéric Olive 4 
2 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
3 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : We establish an exact logical characterization of linear time complexity of cellular automata of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity class iff it is definable in existential second-order logic restricted to monotonic Horn formulas with built-in successor function and d + 1 first-order variables. This logical characterization is optimal modulo an open problem in parallel complexity. Furthermore, its proof provides a systematic method for transforming an inductive formula defining some problem into a cellular automaton that computes it in linear time.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Etienne Grandjean Connect in order to contact the contributor
Submitted on : Thursday, March 23, 2017 - 9:09:03 AM
Last modification on : Wednesday, March 23, 2022 - 3:51:22 PM
Long-term archiving on: : Saturday, June 24, 2017 - 12:31:00 PM


Files produced by the author(s)



Nicolas Bacquey, Etienne Grandjean, Frédéric Olive. Definability by Horn formulas and linear time on cellular automata. 2017. ⟨hal-01494246v1⟩



Record views


Files downloads