Reachability Problem in Non-uniform Cellular Automata

01/24/2019
by   Sumit Adak, et al.
0

This paper deals with the CREP (Configuration REachability Problem) for non-uniform cellular automata (CAs). The cells of non-uniform CAs, we have considered here, can use different Wolfram's rules to generate their next states. We report an algorithm which decides whether or not a configuration of a given (non-uniform) cellular automaton is reachable from another configuration. A characterization tool, named Reachability tree, is used to develop theories and the decision algorithm for the CREP. Though the worst case complexity of the algorithm is exponential in time and space, but the average performance is very good.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

On the Garden of Eden theorem for non-uniform cellular automata

We establish several extensions of the well-known Garden of Eden theorem...
research
01/31/2022

On reversible asynchronous non-uniform cellular automata

We study the class of asynchronous non-uniform cellular automata (ANUCA)...
research
05/29/2010

Failover in cellular automata

A cellular automata (CA) configuration is constructed that exhibits emer...
research
01/21/2015

Lazier ABC

ABC algorithms involve a large number of simulations from the model of i...
research
06/18/2019

Convergence of the Non-Uniform Directed Physarum Model

The directed Physarum dynamics is known to solve positive linear program...
research
08/27/2022

On linear non-uniform cellular automata: duality and dynamics

For linear non-uniform cellular automata (NUCA) over an arbitrary univer...
research
02/18/2019

On the dynamical behaviour of linear higher-order cellular automata and its decidability

Higher-order cellular automata (HOCA) are a variant of cellular automata...

Please sign up or login with your details

Forgot password? Click here to reset