Computational complexity of rule distributions of non-uniform cellular automata

Authors:
Alberto Dennunzio;Enrico Formenti;Julien Provillard
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano---Bicocca, Milano, Italy;Laboratoire I3S, Université Nice-Sophia Antipolis, Sophia Antipolis, France;Laboratoire I3S, Université Nice-Sophia Antipolis, Sophia Antipolis, France
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 11
Cited 2

Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
An introduction to symbolic dynamics and coding

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

Theoretical Computer Science
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm

Theoretical Computer Science
Theory of Codes

Theory of Codes
Number-conserving cellular automata I: decidability

Theoretical Computer Science
Ensembles reconnaissables de mots biinfinis

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Non-uniform Cellular Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
Computing Issues of Asynchronous CA

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

ν-CA are cellular automata which can have different local rules at each site of their lattice. Indeed, the spatial distribution of local rules completely characterizes ν-CA. In this paper, sets of distributions 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 ν-CA.