Skip to Main content Skip to Navigation
Journal articles

Computational complexity of finite asynchronous cellular automata

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01754002
Contributor : Enrico Formenti <>
Submitted on : Thursday, March 29, 2018 - 10:39:49 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:34 PM

Identifiers

Collections

Citation

Enrico Formenti, Alberto Dennunzio, Luca Manzoni, Giancarlo Mauri, Antonio Porreca. Computational complexity of finite asynchronous cellular automata. Theoretical Computer Science, Elsevier, 2017, 664, pp.131 - 143. ⟨10.1016/j.tcs.2015.12.003⟩. ⟨hal-01754002⟩

Share

Metrics

Record views

458