According to our database1, Julien Provillard authored at least 14 papers between 2009 and 2017.
Legend:Book In proceedings Article PhD thesis Other
A Synergic Approach to the Minimal Uncompletable Words Problem.
Journal of Automata, Languages and Combinatorics, 2017
Deterministic One-Way Turing Machines with Sublinear Space.
Fundam. Inform., 2015
Three research directions in non-uniform cellular automata.
Theor. Comput. Sci., 2014
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy.
Proceedings of the Language and Automata Theory and Applications, 2014
Local rule distributions, language complexity and non-uniform cellular automata.
Theor. Comput. Sci., 2013
Acceptance conditions for omega-languages and the Borel hierarchy.
Deterministic one-way Turing machines with sublinear space bounds.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013
Automates cellulaires non-uniformes. (Non-uniform cellular automata).
PhD thesis, 2012
Non-uniform cellular automata: Classes, dynamics, and decidability.
Inf. Comput., 2012
Computational Complexity of Rule Distributions of Non-uniform Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2012
Acceptance Conditions for ω-Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012
Non-uniform cellular automata and distributions of rules
Non-Uniform Cellular Automata: classes, dynamics, and decidability
Non-uniform Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2009