Pacôme Perrotin

18 papers A 1C 4Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2025 — conf
A Sequential Solution to the Density Classification Task Using an Intermediate Alphabet.
AUTOMATA
Pacôme Perrotin, Pedro Paulo Balbi, Eurico L. P. Ruivo
2025 J jnl
Fast solutions to k-parity and k-synchronisation using parallel automata networks.
Theor. Comput. Sci.
Pacôme Perrotin, Eurico L. P. Ruivo, Pedro Paulo Balbi
2025 A conf
Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata.
STACS
Benjamin Hellouin de Menibus, Pacôme Perrotin
2024 J jnl
A sequential solution to the density classification task using an intermediate alphabet.
CoRR
Pacôme Perrotin, Pedro Paulo Balbi de Oliveira, Eurico L. P. Ruivo
2024 J jnl
Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata.
CoRR
Benjamin Hellouin de Menibus, Pacôme Perrotin
2024 J jnl
Fast solutions to k-parity and k-synchronisation using parallel automata networks.
CoRR
Pacôme Perrotin, Eurico L. P. Ruivo, Pedro Paulo Balbi de Oliveira
2024 J jnl
Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates.
J. Comput. Sci.
Eurico L. P. Ruivo, Kévin Perrot, Pedro P. B. de Oliveira, Pacôme Perrotin
2023 J jnl
Associating parallel automata network dynamics and strictly one-way cellular automata.
Nat. Comput.
Pacôme Perrotin
2023 C conf
Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics.
CiE
Pacôme Perrotin, Sylvain Sené
2023 J jnl
Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics.
CoRR
Pacôme Perrotin, Sylvain Sené
2021 J jnl
On Boolean Automata Networks (de)Composition.
Fundam. Informaticae
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
2021 C conf
Optimising Attractor Computation in Boolean Automata Networks.
LATA
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
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
2020 C conf
On the Complexity of Acyclic Modules in Automata Networks.
TAMC
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
2020 J jnl
Optimising attractor computation in Boolean automata networks.
CoRR
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
2019 J jnl
On the complexity of acyclic modules in automata networks.
CoRR
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
2018 C conf
A Framework for (De)composing with Boolean Automata Networks.
MCU
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
2018 J jnl
A framework for (de)composing with Boolean automata networks.
CoRR
Kévin Perrot, Pacôme Perrotin, Sylvain Sené