Proceedings

You can find the Automata invited and regular papers in the OASIcs proceedings and the Automata exploratory papers in the HAL collection.

Invited talks

1. Dynamical properties of disjunctive Boolean networks
   Maximilien Gadouleau
2. Regular Languages: To Finite Automata and Beyond. Succinct Descriptions and Optimal Simulations
   Luca Prigioniero
3. Reversible cellular automata in presence of noise rapidly forget everything
   Siamak Taati
4. Fixed Point Constructions in Tilings and Cellular Automata
   Ilkka Törmä

Regular papers

1. Asynchronous cellular automata and dynamical algebraic combinatorics
   Laurent David, Colin Defant, Michael Joseph, Matthew Macauley and Alex McDonough
2. Rice’s theorem for generic limit sets of cellular automata
   Martin Delacourt
3. Cellular Automata and Kan Extensions
   Alexandre Fernandez, Luidnel Maignan and Antoine Spicher
4. Conjunctive grammars, cellular automata and logic
   Théo Grente and Étienne Grandjean
5. An effective construction for cut-and-project rhombus tilings with global n-fold rotational symmetry
   Victor H. Lutfalla
6. Non-deterministic updates of Boolean networks
   Loïc Paulevé and Sylvain Sené
7. Von Neumann regularity, split epicness and elementary cellular automata
   Ville Salo
8. State-based opacity of real-time automata
   Kuize Zhang

Exploratory papers

1. Cellular automata and substitutions in the edit-distance space
   Firas Ben Ramdhane
2. Cantor equicontinuous factors of the Coven cellular automaton
   Saliha Djenaoui
3. Graph Subshifts
   Amélia Durbec
4. Why are reversible septenary NCCAs so simple? A preliminary inquiry
   Adam Dzedzej, Barbara Wolnik, Maciej Dziemiańczuk, Aleksander Wardyn and Bernard De Baets
5. The Besicovitch-Stability of Noisy Tilings is Undecidable
   Léo Gayral
6. A Landscape of Interval Life-like Freezing Cellular Automata
   Eric Goles, Diego Maldonado, Pedro Montealegre and Martín Ríos Wilson
7. Diameter mean equicontinuity and cellular automata
   Luguis de Los Santos Baños and Felipe García-Ramos
8. Associating parallel automata network dynamics and strictly one-way cellular automata
   Pacôme Perrotin
9. Isomorphic Boolean networks and dense interaction graphs
   Aymeric Picard Marchetto and Adrien Richard
10. Investigations of sub-structures in the parameter space of three-dimensional Turing-like patterns
    Martin Skrodzki, Ulrich Reitebuch and Eric Zimmermann