Jeandel, Emmanuel, Vanier, Pascal
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can...
Subshifts, Languages and Logic (2009)
Jeandel, Emmanuel, Theyssier, Guillaume
We study the Monadic Second Order (MSO) Hierarchy over in?nite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely, we...
Subshifts, Languages and Logic (2009)
Jeandel, Emmanuel, Theyssier, Guillaume
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely,...
Subshifts, Languages and Logic (2009)
Jeandel, Emmanuel, Theyssier, Guillaume
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely,...
Jeandel, Emmanuel, Vanier, Pascal
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can...
Jeandel, Emmanuel, Vanier, Pascal
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can...
Tilings robust to errors (2009)
Ballier, Alexis, Durand, Bruno, Jeandel, Emmanuel
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the objects we obtain...
Tilings robust to errors (2009)
Ballier, Alexis, Durand, Bruno, Jeandel, Emmanuel
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the objects we obtain...
Structural aspects of tilings (2008)
Ballier, Alexis, Durand, Bruno, Jeandel, Emmanuel
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains....
Structural aspects of tilings (2008)
Ballier, Alexis, Durand, Bruno, Jeandel, Emmanuel
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains....
Structural aspects of tilings (2008)
Ballier, Alexis, Durand, Bruno, Jeandel, Emmanuel
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains....
Tilings and model theory (2008)
Ballier, Alexis, Jeandel, Emmanuel
In this paper we emphasize the links between model theory and tilings. More precisely, after giving the definitions of what tilings are, we give a natural way to have an interpretation of the tiling...
Tilings and model theory (2008)
Ballier, Alexis, Jeandel, Emmanuel
In this paper we emphasize the links between model theory and tilings. More precisely, after giving the definitions of what tilings are, we give a natural way to have an interpretation of the tiling...
Finding a Vector Orthogonal to Roughly Half a Collection of Vectors (2008)
Charbit, Pierre, Jeandel, Emmanuel, Koiran, Pascal, Perifel, Sylvain, Thomasse, Stephan
Dimitri Grigoriev has shown that for any family of $N$ vectors in the $d$-dimensional linear space $E=(\ff{2})^d$, there exists a vector in $E$ which is orthogonal to at least $N/3$ and at most...
Finding a Vector Orthogonal to Roughly Half a Collection of Vectors (2008)
Charbit, Pierre, Jeandel, Emmanuel, Koiran, Pascal, Perifel, Sylvain, Thomasse, Stephan
Dimitri Grigoriev has shown that for any family of $N$ vectors in the $d$-dimensional linear space $E=(\ff{2})^d$, there exists a vector in $E$ which is orthogonal to at least $N/3$ and at most...
Quantum Automata and Algebraic Groups (2007)
Ecole Normale, Superieure Lyon, Unite Mixte, Emmanuel Jeandel, Emmanuel Je, ...
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest:...
Structural aspects of tilings (2007)
Ballier, Alexis, Durand, Bruno, Jeandel, Emmanuel
We are interested in the structure of tilings that can be obtained from a given tile sets. We choose to study this structure by comparing the set of finite patterns they contain. We use two different...
Finding a Vector Orthogonal to Roughly Half a Collection of Vectors (2007)
Charbit, Pierre, Jeandel, Emmanuel, Koiran, Pascal, Perifel, Sylvain, Thomassé, Stéphan
Dimitri Grigoriev has shown that for any family of N vectors in the d-dimensional linear space E = (F_2)^d, there exists a vector in E which is orthogonal to at least N/3 and at most 2N/3 vectors of...
Finding a Vector Orthogonal to Roughly Half a Collection of Vectors (2007)
Charbit, Pierre, Jeandel, Emmanuel, Koiran, Pascal, Perifel, Sylvain, Thomassé, Stéphan
Dimitri Grigoriev has shown that for any family of N vectors in the d-dimensional linear space E = (F_2)^d, there exists a vector in E which is orthogonal to at least N/3 and at most 2N/3 vectors of...
Finding a vector orthogonal to roughly half a collection of vectors (2006)
Charbit, Pierre, Jeandel, Emmanuel, Koiran, Pascal, Perifel, Sylvain, Thomasse, Stefan
11 pages, 16 références bibliographiques
Playing with Conway's Problem (2005)
Jeandel, Emmanuel, Ollinger, Nicolas
The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a...
Playing with Conway's Problem (2005)
Jeandel, Emmanuel, Ollinger, Nicolas
The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a...
Playing with Conway's Problem (2005)
Jeandel, Emmanuel, Ollinger, Nicolas
The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a...
Playing with Conway's Problem (2005)
Jeandel, Emmanuel, Ollinger, Nicolas
The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a...
Playing with Conway's Problem (2005)
Jeandel, Emmanuel, Ollinger, Nicolas
The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a...
Playing with Conway's Problem (2005)
Jeandel, Emmanuel, Ollinger, Nicolas
The centralizer of a language is the maximal language commuting with it. The question, raised by Conway in 1971, whether the centralizer of a rational language is always rational, recently received a...
Decidable and undecidable problems about quantum automata (2005)
Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran
Abstract. We study the following decision problem: is the language recognized by a quantum nite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on...
Decidable and undecidable problems about quantum automata (2005)
Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier
Abstract. We study the following decision problem: is the language recognized by a quantum finite automaton empty or nonempty? We prove that this problem is decidable or undecidable depending on...
Quantum automata and algebraic groups. (2003)
Derksen, Harm, Jeandel, Emmanuel, Koiran, Pascal
(eng) We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent...
Decidable and undecidable problems about quantum automata (2003)
Blondel, Vincent D., Jeandel, Emmanuel, Koiran, Pascal, Portier, Natacha
We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether...
Decidable and undecidable problems about quantum automata. (2003)
Blondel, Vincent D., Jeandel, Emmanuel, Koiran, Pascal, Portier, Natacha
(eng) We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether...
Quantum Automata and Algebraic Groups Harm Derksen, (2003)
École Normale, Supérieure Lyon, Unité Mixte, Emmanuel Jeandel, Pascal Koiran, ...
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest:...
Évaluation rapide de fonctions hypergéométriques (2000)
Nous présentons ici l'implantation des fonctions hypergéométriques dans la bibliothèque MPFR. Ceci a été effectué à l'aide de la méthode Binary Splitting. Un algorithme générique a donc...
Évaluation rapide de fonctions hypergéométriques (2000)
Nous présentons ici l'implantation des fonctions hypergéométriques dans la bibliothèque MPFR. Ceci a été effectué à l'aide de la méthode Binary Splitting. Un algorithme générique a donc...
Évaluation rapide de fonctions hypergéométriques (2000)
Nous présentons ici l'implantation des fonctions hypergéométriques dans la bibliothèque MPFR. Ceci a été effectué à l'aide de la méthode Binary Splitting. Un algorithme générique a donc...
www.stacs-conf.org STRUCTURAL ASPECTS OF TILINGS
Alexis Ballier, Bruno Durand, Emmanuel Jeandel
Abstract. In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling...