Descriptive complexity for minimal time of cellular automata - GREYC amacc Access content directly
Preprints, Working Papers, ... Year : 2019

Descriptive complexity for minimal time of cellular automata

Abstract

Descriptive complexity may be useful to design programs in a natural declarative way. This is important for parallel computation models such as cellular automata, because designing parallel programs is considered difficult. Our paper establishes logical characterizations of the three classical complexity classes that model minimal time, called real-time, of one-dimensional cellular automata according to their canonical variants. Our logics are natural restrictions of the existential second-order Horn logic. They correspond to the three ways of deciding a language on a square grid circuit of side n according to the three canonical placements of an input word of length n on the grid. Our key tool is a normalization method that transforms a formula into an equivalent formula that literally mimics a grid circuit.
Fichier principal
Vignette du fichier
HORN_RealTime_complexity.pdf (312.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02020180 , version 1 (15-02-2019)
hal-02020180 , version 2 (25-02-2019)
hal-02020180 , version 3 (07-03-2019)

Identifiers

  • HAL Id : hal-02020180 , version 3

Cite

Etienne Grandjean, Théo Grente. Descriptive complexity for minimal time of cellular automata. 2019. ⟨hal-02020180v3⟩
154 View
154 Download

Share

Gmail Facebook X LinkedIn More