Preface
- PDF / 153,910 Bytes
- 2 Pages / 595.276 x 790.866 pts Page_size
- 62 Downloads / 239 Views
(0123456789().,-volV)(0123456789(). ,- volV)
Preface Jan Baetens1 • Martin Kutrib2
Ó Springer Nature B.V. 2020
This special issue of Natural Computing is dedicated to cellular automata and related systems. It is based on AUTOMATA 2018, the 24th International Workshop on Cellular Automata and Discrete Complex Systems, held in Ghent, Belgium, June 20–22, 2018. AUTOMATA 2018 was organized by the Research Unit Knowledge-based Systems of the Department of Data Analysis and Mathematical Modelling of Ghent University. The event was an IFIP Working Conference and it hosted the annual meeting of the IFIP Working Group 1.5. AUTOMATA 2018 continued an annual series of workshops established in 1995 as a forum for the collaboration of researchers in the field of cellular automata and related discrete complex systems. The purpose of this workshop is to highlight the major advances in the field and the development of new tools, to support the development of theory and applications of CA and DCS and to identify and study within an inter- and multidisciplinary context, the important fundamental aspects, concepts, notions and problems concerning CA and DCS. Cellular automata are among the first nature inspired models of computation, introduced by John von Neumann and Stanislaw Ulam to study self-replication and universality. Cellular automata are physically realistic massively parallel computation models that also have versatile applications as discrete models in physics and other natural sciences. Cellular automata obey realistic constraints of locality, uniformity, and parallelism which makes them an ideal model in these contexts. Other relevant properties such as time-reversibility and conservation laws can be
& Jan Baetens [email protected] Martin Kutrib [email protected] 1
Department of Data Analysis and Mathematical Modelling, Ghent University, Coupure Links 653, 9000 Gent, Belgium
2
Institut fu¨r Informatik, Universita¨t Giessen, Arndtstr. 2, 35392 Giessen, Germany
conveniently imposed at will. In mathematics, cellular automata are studied as discrete dynamical systems in topological and symbolic dynamics. From the articles presented at the workshop and included in a LNCS volume, 5 papers were selected. Their authors were invited to submit extended and improved versions to be published in this special issue. Each paper was carefully reviewed by two expert referees and finally the following 4 papers have been accepted for publication. The paper Sequentializing cellular automata by Jarkko Kari, Ville Salo, and Thomas Worsch studies the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. It gives a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right. The second paper G
