On shift-invariant maximal filters and hormonal cellular automata

International audience This paper deals with the construction of shift-invariant maximal filters on ℤ and their relation to hormonal cellular automata, a generalization of the cellular automata computation model with some information about the global state shared among all the cells. We first design...

Full description

Bibliographic Details
Published in:2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Main Authors: Cervelle, Julien, Lafitte, Grégory
Other Authors: Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), Systèmes complexes, automates et pavages (ESCAPE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)
Format: Conference Object
Language:English
Published: HAL CCSD 2017
Subjects:
Online Access:https://hal.science/hal-01615278
https://doi.org/10.1109/LICS.2017.8005145
Description
Summary:International audience This paper deals with the construction of shift-invariant maximal filters on ℤ and their relation to hormonal cellular automata, a generalization of the cellular automata computation model with some information about the global state shared among all the cells. We first design shift-invariant maximal filters in order to define this new model of computation. Starting from different assumptions, we show how to construct such filters, and analyze the computation power of the induced cellular automata computation model.