Descriptive complexity for minimal time of cellular automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Descriptive complexity for minimal time of cellular automata

Dates et versions

hal-02276603 , version 1 (02-09-2019)

Identifiants

Citer

Etienne Grandjean, Théo Grente. Descriptive complexity for minimal time of cellular automata. 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2019, Vancouver, Canada. pp.1-13, ⟨10.1109/LICS.2019.8785666⟩. ⟨hal-02276603⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More