Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Descriptive complexity for minimal time of cellular automata

Etienne Grandjean 1 Théo Grente 1
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
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.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02020180
Contributor : Théo Grente <>
Submitted on : Thursday, March 7, 2019 - 5:56:09 PM
Last modification on : Tuesday, April 2, 2019 - 1:35:08 AM
Long-term archiving on: : Sunday, June 9, 2019 - 10:13:05 AM

Files

HORN_RealTime_complexity.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02020180, version 3

Citation

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

Share

Metrics

Record views

93

Files downloads

210