A Framework for (De)composing with Boolean Automata Networks. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (MCU, 2018)

On the Complexity of Acyclic Modules in Automata Networks. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (TAMC, 2020)

Optimising Attractor Computation in Boolean Automata Networks. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (LATA, 2021)

On Boolean Automata Networks (de)Composition. - Kévin Perrot; Pacôme Perrotin; Sylvain Sené (Fundam. Informaticae, 2021)

Simulation entre modèles de calcul naturel et modularité des réseaux d'automate. (Simulation between natural computation models and automata networks modularity). - Pacôme Perrotin (2021)

Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics. - Pacôme Perrotin; Sylvain Sené (CiE, 2023)

Associating parallel automata network dynamics and strictly one-way cellular automata. - Pacôme Perrotin (Nat. Comput., 2023)

A sequential solution to the density classification task using an intermediate alphabet. - Pacôme Perrotin; Pedro Paulo Balbi de Oliveira; Eurico L. P. Ruivo (CoRR, 2024)

Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata. - Benjamin Hellouin de Menibus; Pacôme Perrotin (CoRR, 2024)

Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates. - Eurico L. P. Ruivo; Kévin Perrot; Pedro P. B. de Oliveira; Pacôme Perrotin (J. Comput. Sci., 2024)

Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata. - Benjamin Hellouin de Menibus; Pacôme Perrotin (STACS, 2025)

Fast solutions to k-parity and k-synchronisation using parallel automata networks. - Pacôme Perrotin; Eurico L. P. Ruivo; Pedro Paulo Balbi (Theor. Comput. Sci., 2025)