Advanced search
1 file | 973.73 KB Add to list

Reversibility of non-saturated linear cellular automata on finite triangular grids

(2021) CHAOS. 31(1).
Author
Organization
Abstract
Discrete dynamical systems such as cellular automata are of increasing interest to scientists in a variety of disciplines since they are simple models of computation capable of simulating complex phenomena. For this reason, the problem of reversibility of such systems is very important and, therefore, recurrently taken up by researchers. Unfortunately, the study of reversibility is remarkably hard, especially in the case of two- or higher-dimensional cellular automata. In this paper, we propose a novel and simple method that allows us to completely resolve the reversibility problem of a wide class of linear cellular automata on finite triangular grids with null boundary conditions.
Keywords
Mathematical Physics, General Physics and Astronomy, Applied Mathematics, Statistical and Nonlinear Physics

Downloads

  • (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 973.73 KB

Citation

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

MLA
Wolnik, Barbara, et al. “Reversibility of Non-Saturated Linear Cellular Automata on Finite Triangular Grids.” CHAOS, vol. 31, no. 1, 2021, doi:10.1063/5.0031535.
APA
Wolnik, B., Augustynowicz, A., Dziemiańczuk, M., & De Baets, B. (2021). Reversibility of non-saturated linear cellular automata on finite triangular grids. CHAOS, 31(1). https://doi.org/10.1063/5.0031535
Chicago author-date
Wolnik, Barbara, Antoni Augustynowicz, Maciej Dziemiańczuk, and Bernard De Baets. 2021. “Reversibility of Non-Saturated Linear Cellular Automata on Finite Triangular Grids.” CHAOS 31 (1). https://doi.org/10.1063/5.0031535.
Chicago author-date (all authors)
Wolnik, Barbara, Antoni Augustynowicz, Maciej Dziemiańczuk, and Bernard De Baets. 2021. “Reversibility of Non-Saturated Linear Cellular Automata on Finite Triangular Grids.” CHAOS 31 (1). doi:10.1063/5.0031535.
Vancouver
1.
Wolnik B, Augustynowicz A, Dziemiańczuk M, De Baets B. Reversibility of non-saturated linear cellular automata on finite triangular grids. CHAOS. 2021;31(1).
IEEE
[1]
B. Wolnik, A. Augustynowicz, M. Dziemiańczuk, and B. De Baets, “Reversibility of non-saturated linear cellular automata on finite triangular grids,” CHAOS, vol. 31, no. 1, 2021.
@article{8690063,
  abstract     = {{Discrete dynamical systems such as cellular automata are of increasing interest to scientists in a variety of disciplines since they are simple models of computation capable of simulating complex phenomena. For this reason, the problem of reversibility of such systems is very important and, therefore, recurrently taken up by researchers. Unfortunately, the study of reversibility is remarkably hard, especially in the case of two- or higher-dimensional cellular automata. In this paper, we propose a novel and simple method that allows us to completely resolve the reversibility problem of a wide class of linear cellular automata on finite triangular grids with null boundary conditions.}},
  articleno    = {{013136}},
  author       = {{Wolnik, Barbara and Augustynowicz, Antoni and Dziemiańczuk, Maciej and De Baets, Bernard}},
  issn         = {{1054-1500}},
  journal      = {{CHAOS}},
  keywords     = {{Mathematical Physics,General Physics and Astronomy,Applied Mathematics,Statistical and Nonlinear Physics}},
  language     = {{eng}},
  number       = {{1}},
  pages        = {{9}},
  title        = {{Reversibility of non-saturated linear cellular automata on finite triangular grids}},
  url          = {{http://doi.org/10.1063/5.0031535}},
  volume       = {{31}},
  year         = {{2021}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: