Descriptive complexity for minimal time of cellular automata

DOI10.5555/3470152.3470164MaRDI QIDQ6654477zbMATH OpenFDO

Authors Etienne Grandjean, Théo Grente

Publication date 19 December 2024

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Descriptive complexity and finite models (68Q19)

Recommendations

• Definability by Horn formulas and linear time on cellular automata
• Descriptive complexity for pictures languages
• A logical approach to locality in pictures languages
• scientific article; zbMATH DE number 2068878
• A characterization of constant-time cellular automata computation

This page was built for publication: Descriptive complexity for minimal time of cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654477)