Buch, Englisch, 243 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 394 g
31st IFIP WG 1.5 International Workshop, AUTOMATA 2025, Lille, France, June 30 - July 2, 2025, Proceedings
Buch, Englisch, 243 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 394 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-01569-3
Verlag: Springer
This book constitutes the proceedings from the 31st IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2025, held in Lille, France, during June 30–July 2, 2025.
The 11 full papers and 4 invited papers presented in this proceedings were carefully reviewed and selected from 19 submissions. The AUTOMATA series is the official annual event of IFIP WG 1.5, the Working Group 5 (on Cellular Automata and Discrete Complex Systems), of the Technical Committee 1 (on Foundations of Computer Science), of the International Federation for Information Processing (IFIP). AUTOMATA is an annual, international, multidisciplinary conference for experts in cellular automata and complex dynamic systems.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
.- Determination of platelets properties in blood: combining discrete numerical models with experiments.
.- Searching for Attractors : To infinity and beyond.
.- Cellular automata and percolation: an overview of selected connections.
.- In search of cellular automata that preserve numbers: advances, limitations, and open problems.
.- Categorical products of cellular automata.
.- On Gottschalk’s surjunctivity conjecture for non-uniform cellular automata.
.- Ternary cellular automata induced by semigroups of order 3 are solvable.
.- A sequential solution to the density classification task using an intermediate alphabet.
.- Descriptive Complexity of Sensitivity of Cellular Automata.
.- Conditions for cyclic attractors for a class of discrete n-dimensional repressilators.
.- Symbol Frequencies in Surjective Cellular Automata.
.- Solving “pseudo-injective” polynomial equations over finite dynamical systems.
.- Self-Orthogonal Cellular Automata.
.- Timed Prediction Problem for Sandpile Models.
.- Ergodicity of the hard-core PCA with a random walk method.
