Descriptive complexity for minimal time of cellular automata

Étienne Grandjean, Théo Grente

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…