Output details
11 - Computer Science and Informatics
University of York
Article title
Automorphisms of Transition Graphs for Elementary Cellular Automata
Type
D - Journal article
DOI
-
Title of journal
JOURNAL OF CELLULAR AUTOMATA
Article number
-
Volume number
4
Issue number
2
First page of article
125
ISSN of journal
1557-5969
Year of publication
2009
Number of additional authors
1
Additional information
<13>Originality:
CAs are an important unconventional computational paradigm, specified in terms of local rules. This work initiated a new way of characterising and classifying CAs, in terms of symmetries inherent in their global dynamical behaviour.
Significance:
This led to subsequent publications, one deepening the results in the case of non-trivial ECA rule 90, and one extending to analytical results for the number of pre-images by exploiting de Bruijn matrices.
Rigour:
This comprised a combination of group theory applied to transition graphs to gain analytical results, then numerical evaluation of these over a range of CA sizes.
Interdisciplinary
-
Cross-referral requested
-
Research group
I - Non-Standard Computation
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
