Non-uniform Cellular Automata. - Gianpiero Cattaneo; Alberto Dennunzio; Enrico Formenti; Julien Provillard (LATA, 2009)

Non-uniform cellular automata and distributions of rules - Julien Provillard; Enrico Formenti; Alberto Dennunzio (CoRR, 2011)

Acceptance Conditions for ω-Languages. - Alberto Dennunzio; Enrico Formenti; Julien Provillard (Developments in Language Theory, 2012)

Computational Complexity of Rule Distributions of Non-uniform Cellular Automata. - Alberto Dennunzio; Enrico Formenti; Julien Provillard (LATA, 2012)

Non-uniform cellular automata: Classes, dynamics, and decidability. - Alberto Dennunzio; Enrico Formenti; Julien Provillard (Inf. Comput., 2012)

Automates cellulaires non-uniformes. (Non-uniform cellular automata). - Julien Provillard (2012)

Deterministic one-way Turing machines with sublinear space bounds. - Martin Kutrib; Julien Provillard; György Vaszil; Matthias Wendlandt (NCMA, 2013)

Acceptance conditions for omega-languages and the Borel hierarchy. - Julien Cervelle; Alberto Dennunzio; Enrico Formenti; Julien Provillard (CoRR, 2013)

Local rule distributions, language complexity and non-uniform cellular automata. - Alberto Dennunzio; Enrico Formenti; Julien Provillard (Theor. Comput. Sci., 2013)

ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. - Enrico Formenti; Markus Holzer 001; Martin Kutrib; Julien Provillard (LATA, 2014)

Three research directions in non-uniform cellular automata. - Alberto Dennunzio; Enrico Formenti; Julien Provillard (Theor. Comput. Sci., 2014)

Deterministic One-Way Turing Machines with Sublinear Space. - Martin Kutrib; Julien Provillard; György Vaszil; Matthias Wendlandt (Fundam. Informaticae, 2015)

A Synergic Approach to the Minimal Uncompletable Words Problem. - Sandrine Julia; Arnaud Malapert; Julien Provillard (J. Autom. Lang. Comb., 2017)

Puzzle - Solving the n-Fractions Puzzle as a Constraint Programming Problem. - Arnaud Malapert; Julien Provillard (INFORMS Trans. Educ., 2018)