Pacôme Perrotin

According to our database, Pacôme Perrotin authored at least 11 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

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

Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata.

Benjamin Hellouin de Menibus, Pacôme Perrotin

CoRR, 2024

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

Fast solutions to k-parity and k-synchronisation using parallel automata networks.

Pacôme Perrotin, Eurico L. P. Ruivo, Pedro Paulo Balbi de Oliveira

CoRR, 2024

2023

Associating parallel automata network dynamics and strictly one-way cellular automata.

Pacôme Perrotin

Nat. Comput., September, 2023

Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics.

Pacôme Perrotin, Sylvain Sené

Proceedings of the Unity of Logic and Computation, 2023

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

PhD thesis, 2021

On Boolean Automata Networks (de)Composition.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Fundam. Informaticae, 2021

Optimising Attractor Computation in Boolean Automata Networks.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Proceedings of the Language and Automata Theory and Applications, 2021

2020

On the Complexity of Acyclic Modules in Automata Networks.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Proceedings of the Theory and Applications of Models of Computation, 2020

2018

A Framework for (De)composing with Boolean Automata Networks.

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018