24 citations · 130 across the 60 of their papers we have counts for
4 papers · 1 filter
Commutative automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
Automata networks are mappings of the form f : Q Z Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networ…
Latin Hypercubes and Cellular Automata
Maximilien Gadouleau, Luca Mariot
Latin squares and hypercubes are combinatorial designs with several applications in statistics, cryptography and coding theory. In this paper, we generalize a construction of Latin…
Grover's Algorithm and Many-Valued Quantum Logic
Samuel Hunt, Maximilien Gadouleau
As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate G…
On simulation in automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the config…