Advanced search
1 file | 946.91 KB

Cellular automata on irregular tessellations

Jan Baetens (UGent) and Bernard De Baets (UGent)
Author
Organization
Abstract
To this day, most articles on cellular automata (CA) employ regular tessellations of R-n, notwithstanding this kind of tessellation suffers from a few serious drawbacks limiting the appraisal of regular CA as full-fledged modelling tools. In this article, we propose an extension to the classical CA paradigm, by allowing irregular tessellations of R-n, which, in essence, encloses the regular tessellations as a special case. After a short review on the major shortcomings of CA on regular tessellations, we establish a definition for CA on irregular tessellations of R-n that is followed by a profound elaboration of its constituents. In addition, we propose a graph representation that is applicable to an important family of irregular CA, and, in accordance with the framework developed for CA on regular tessellations, we present an enumeration scheme for the k-state, theta-sum irregular (outer-)totalistic CA. Illustrative examples conclude this article.
Keywords
discrete dynamical systems, cellular automata, enumeration, formalism, irregular tessellations, MODEL, SIMULATION, DYNAMICS, FIRE, RAINFALL, WILDFIRE, NETWORK, SYSTEMS, GROWTH, GAME

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 946.91 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Baetens, Jan, and Bernard De Baets. 2012. “Cellular Automata on Irregular Tessellations.” Dynamical Systems-an International Journal 27 (4): 411–430.
APA
Baetens, Jan, & De Baets, B. (2012). Cellular automata on irregular tessellations. DYNAMICAL SYSTEMS-AN INTERNATIONAL JOURNAL, 27(4), 411–430.
Vancouver
1.
Baetens J, De Baets B. Cellular automata on irregular tessellations. DYNAMICAL SYSTEMS-AN INTERNATIONAL JOURNAL. 2012;27(4):411–30.
MLA
Baetens, Jan, and Bernard De Baets. “Cellular Automata on Irregular Tessellations.” DYNAMICAL SYSTEMS-AN INTERNATIONAL JOURNAL 27.4 (2012): 411–430. Print.
@article{3220345,
  abstract     = {To this day, most articles on cellular automata (CA) employ regular tessellations of R-n, notwithstanding this kind of tessellation suffers from a few serious drawbacks limiting the appraisal of regular CA as full-fledged modelling tools. In this article, we propose an extension to the classical CA paradigm, by allowing irregular tessellations of R-n, which, in essence, encloses the regular tessellations as a special case. After a short review on the major shortcomings of CA on regular tessellations, we establish a definition for CA on irregular tessellations of R-n that is followed by a profound elaboration of its constituents. In addition, we propose a graph representation that is applicable to an important family of irregular CA, and, in accordance with the framework developed for CA on regular tessellations, we present an enumeration scheme for the k-state, theta-sum irregular (outer-)totalistic CA. Illustrative examples conclude this article.},
  author       = {Baetens, Jan and De Baets, Bernard},
  issn         = {1468-9367},
  journal      = {DYNAMICAL SYSTEMS-AN INTERNATIONAL JOURNAL},
  language     = {eng},
  number       = {4},
  pages        = {411--430},
  title        = {Cellular automata on irregular tessellations},
  url          = {http://dx.doi.org/10.1080/14689367.2012.711300},
  volume       = {27},
  year         = {2012},
}

Altmetric
View in Altmetric
Web of Science
Times cited: