Local rule distributions, language complexity and non-uniform cellular automata

Authors:
Alberto Dennunzio;Enrico Formenti;Julien Provillard
Affiliations:
Universití degli Studi di Milano-Bicocca, Dipartimento di Informatica, Sistemistica e Comunicazione, Viale Sarca 336, 20126 Milano, Italy;Université Nice Sophia Antipolis, Laboratoire I3S, 2000 Route des Colles, 06903 Sophia Antipolis, France;Université Nice Sophia Antipolis, Laboratoire I3S, 2000 Route des Colles, 06903 Sophia Antipolis, France
Venue:
Theoretical Computer Science
Year:
2013

Citing 15
Cited 3

The nilpotency problem of one-dimensional cellular automata

SIAM Journal on Computing
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Finite acceptance of infinite words

Theoretical Computer Science
Number-conserving cellular automaton rules

Fundamenta Informaticae - Special issue on cellular automata
Number-conserving cellular automata I: decidability

Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
A Predator-Prey Cellular Automaton with Parasitic Interactions and Environmental Effects

Fundamenta Informaticae
Non-uniform Cellular Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Conservation of some dynamical properties for operations on cellular automata

Theoretical Computer Science
Sand automata as cellular automata

Theoretical Computer Science
On the directional dynamics of additive cellular automata

Theoretical Computer Science
On the undecidability of the limit behavior of Cellular Automata

Theoretical Computer Science
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences
Application of linear hybrid cellular automata to stream ciphers

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Non-uniform cellular automata: Classes, dynamics, and decidability

Information and Computation

Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues

Theoretical Computer Science
m-Asynchronous cellular automata: from fairness to quasi-fairness

Natural Computing: an international journal
Computing Issues of Asynchronous CA

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper investigates a variant of cellular automata, namely @n-CA. Indeed, @n-CA are cellular automata which can have different local rules at each site of their lattice. The assignment of local rules to sites of the lattice completely characterizes @n-CA. In this paper, sets of assignments sharing some interesting properties are associated with languages of bi-infinite words. The complexity classes of these languages are investigated providing an initial rough classification of @n-CA.