Skip to Main content Skip to Navigation
Book sections

Language Recognition by Cellular Automata

Véronique Terrier 1
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : Cellular automata (CA) comprise a simple and well-formalized model of massively parallel computation, which is known to be capable of universal computation. Because of their parallel behavior, CA have rich abilities of information processing; however, it is not easy to define their power limitations. A convenient approach to characterizing the computation capacity of CA is to investigate their complexity classes. This chapter discusses the CA complexity classes and their relationships with other models of computations.
Complete list of metadatas
Contributor : Greyc Référent <>
Submitted on : Monday, November 24, 2014 - 11:11:33 AM
Last modification on : Tuesday, February 5, 2019 - 12:12:41 PM



Véronique Terrier. Language Recognition by Cellular Automata. Handbook of Natural Computing, Springer Berlin Heidelberg, 2012, 978-3-540-92909-3. ⟨10.1007/978-3-540-92910-9_4⟩. ⟨hal-01086432⟩



Record views