1994•Unpublished venueRequires access

Different kinds of neighborhood-varying cellular automata

Jean‐Christophe Dubacq

Abstract

The mainframe of this work has been the study of cellular automata as very simple SIMD systems. We introduce some variations over the basic definition of cellular automata in order to compare these new models with other models of cellular automata. The neighborhood-varying cellular automata is shown to be as powerful as time-varying cellular automata. The dynamically reconfigurable cellular automata are more interesting because they effectively reduce the running-time for some normal CA computations. Then some

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Cellular automaton, Mobile automaton, Continuous spatial automaton, Stochastic cellular automaton, Computer science, Asynchronous cellular automaton, Quantum cellular automaton, Simple (philosophy)