Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-08-05
Computer Science
Formal Languages and Automata Theory
Scientific paper
In this paper we study $\nu$-CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced $\nu$-CA has some properties. In a first part, we give some background for the study of $\nu$-CA. Then surjectivity and injectivity are studied using a variant of DeBruijn graphs. The next part is dedicated to the number-conserving property.
Dennunzio Alberto
Formenti Enrico
Provillard Julien
No associations
LandOfFree
Non-uniform cellular automata and distributions of rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Non-uniform cellular automata and distributions of rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-uniform cellular automata and distributions of rules will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-956