Pacôme Perrotin

PHD. in fundamental computer science

Contact : firstname dot surname at gmail dot com

Research themes

I research natural computation models (automata networks in particular) and the concept of simulation between them. More specifically, I am developping a modular framework for automata networks called modules. My recent research work extends to the study of convergence tasks in cellular automata, and the study of the alternating hierarchy of non-deterministic picture-walking finite automata.

Experience

Post-doctorate

Universidade Presbiteriana Mackenzie

2023-2024

On the study of convergence tasks in cellular automata

Teaching position

IUT d'Orsay

2023

190 hours of teaching

Temporary assignement to education and research (ATER)

Aix-Marseille University

2020-2022

400 hours of teaching

PHD study

Aix-Marseille University

2017-2021

200 hours of teaching. Defended on the 12th of January, 2021.

Thesis

Simulation entre modèles de calcul naturel et modularité des réseaux d'automates

2021

( HAL )

Publications

Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics

Pacôme Perrotin and Sylvain Sené

2023

in proceedings of CiE 2023 ( DOI, HAL )

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

Pacôme Perrotin

2023

in Natural Computing ( DOI, HAL )

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

Pacôme Perrotin

2021

in proceedings of Automata 2021, exploratory paper ( HAL )

Optimising attractor computation in Boolean automata networks

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

2021

in proceedings of LATA 2020 / 2021 ( DOI, HAL )

On the complexity of acyclic modules in automata networks

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

2020

in proceedings of TAMC 2020 ( DOI HAL )

On Boolean automata networks (de) composition

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

2020

in Fundamenta Informaticae ( DOI HAL )

A framework for (de) composing with Boolean automata networks

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

2018

in proceedings of MCU 2018 ( DOI HAL )