Given two trees (a target T and a pattern P) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtreeof T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjacent to v are also deleted, and outgoing edges are replaced by edges going from the parent of v (if it exists) to the children of v).Deciding whether P is an embedded subtree of T is known to be NP-complete. Our algorithms run in time O(|T|22|P|) where |T| (resp. |P|) is the size of T (resp. P).

This paper is a contribution to the general tiling problem for the hyperbolic plane.It is an intermediary result between the result obtained by R. Robinson [Invent. Math.44 (1978) 259–264]and the conjecture that the problem is undecidable.

Lorsqu'on observe des orbites de certains automates cellulaires, on peut penser qu'elles apparaissent comme des mélanges d'orbites d'autres automates (composants). Dans cet article, nous tentons de comprendre ce phénomène en construisant un hybride de deux automates au moyen d'un troisième. Deux types d'automates cellulaires sont introduits : les captifs et les foulards. Nous comparons des propriétés de ces hybrides dans le cadre des classifications algébriques introduites par [B. Martin (2001) ; N. Ollinger (2002) ; I. Rapaport (1998) ; G. Teyssier (2005) : PhD. Thesis, École Normale Supérieure de Lyon].

Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.

We give a complete characterization of the class of functions that arethe intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic caseof recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers.

Cameron introduced the orbit algebra of a permutation group and conjectured that this algebra is an integral domain if and only if the group has no finite orbit. We prove that this conjecture holds and in fact that the age algebra of a relational structure R is an integral domain if and only if R is age-inexhaustible. We deduce these results from a combinatorial lemma asserting that if a product of two non-zero elements of a set algebra is zero then there is a finite common tranversal of their supports. The proof is built on Ramsey theorem and the integrity of a shuffle algebra.


 (1) Shepherdson proved that a discrete unitary commutative semi-ring A + satisfies IE 0 (induction scheme restricted to quantifierfree formulas) iff A is integral part of a real closed field; and Berarducci asked about extensions of this criterion when exponentiation is added to the language of rings. Let T range over axiom systems for ordered fields with exponentiation; for three values of T we provide a theory $_{\llcorner} T _{\lrcorner}$ in the language of rings plus exponentiation such that the models (A, expA ) of $_{\llcorner} T _{\lrcorner}$ are all integral parts A of models M of T with A + closed under expM and expA = expM | A+. Namely T = EXP, the basic theory of real exponential fields; T = EXP+ the Rolle and the intermediate value properties for all 2x-polynomials; and T = Texp , the complete theory of the field of reals with exponentiation.(2) $_{\llcorner}$ Texp $_{\lrcorner}$ is recursively axiomatizable iff Texp is decidable.  $_{\llcorner}$ Texp $_{\lrcorner}$ implies LE0(xy) (least element principle for open formulas in the language <,+,x,-1,xy ) but the reciprocal is an open question. $_{\llcorner}$ Texp $_{\lrcorner}$ satisfies “provable polytime witnessing”: if $_{\llcorner} $ Texp $_{\lrcorner}$ proves ∀x∃y : |y| < |x|k)R(x,y) (where $|y|:=_{\llcorner}$ log(y) $_{\lrcorner}$ , k < ω and R is an NP relation), then it proves ∀x R(x,ƒ(x)) for some polynomial time function f.(3) We introduce “blunt” axioms for Arithmetics: axioms which do as if every real number was a fraction (or even a dyadic number). The falsity of such a contention in the standard model of the integers does not mean inconsistency; and bluntness has both a heuristic interest and a simplifying effect on many questions – in particular we prove that the blunt version of $_{\llcorner}$ Texp $_{\lrcorner}$ is a conservative extension of $_{\llcorner} $ Texp $_{\lrcorner}$ for sentences in ∀Δ0(xy ) (universal quantifications of bounded formulas in the language of rings plus xy ). Blunt Arithmetics – which can be extended to a much richer language – could become a useful tool in the non standard approach to discrete geometry, to modelization and to approximate computation with reals.


We consider logics on $\mathbb{Z}$ and $\mathbb{N}$ which are weaker than Presburger arithmetic and we settle the following decision problem: given a k-ary relation on $\mathbb{Z}$ and $\mathbb{N}$ which are first order definable inPresburger arithmetic, are they definable in theseweaker logics? These logics, intuitively,are obtained by considering modulo and threshold counting predicates for differences of two variables.

We prove that there exists a structure M whose monadic second order theory is decidable, and such that the first-order theory of every expansion of M by a constant is undecidable. 


We design algorithms of “optimal" data complexity for several natural problems about first-order queries on structures of bounded degree. For that purpose, we first introduce a framework to deal with logical or combinatorial problems R ⊂ I x O whose instances x ∈ I may admit of several solutions R(x) = {y ∈ O : (x,y) ∈ R}. One associates to such a problem several specific tasks: compute a random (for the uniform probability distribution) solution y ∈ R(x); enumerate without repetition each solution y j in some specific linear order y0 < y1 < ... < yn-1 where R(x) = {y0,...,yn-1}; compute the solution y j of rankj in the linear order <.Algorithms of “minimal" data complexity are presented for the following problems: given any first-order formula $\varphi(\bar{v})$ and any structure S of bounded degree:(1) compute a random element of $\varphi(S)=\{\bar{a}: (S,\bar{a})\models\varphi(\bar{v})\}$ ;(2) compute the jth element of $\varphi(S)$ for some linear order of $\varphi(S)$ ;(3) enumerate the elements of $\varphi(S)$ in lexicographical order.More precisely, we prove that, for any fixed formula φ, the above problem (1) (resp. (2), (3)) can be computed within average constant time (resp. within constant time, with constant delay) after a linear (O(|S|)) precomputation. Our essential tool for deriving those complexity results is a normalization procedure of first-order formulas on bijective structures.

We define the class of discrete classical categorial grammars, similar inthe spirit to the notion of reversible class of languages introduced by Angluin andSakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.

In this paper, we study the continuity of rational functions realized by Büchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function is continuous. We prove here that surprisingly, it cannot be decided whether such a function f has at least one point of continuity and that its continuity set C(f) cannot be computed. In the case of a synchronous rational function, we show that its continuity set is rational and that it can be computed. Furthermore we prove that any rational ${\bf \Pi}^0_2$ -subset of Σω for some alphabet Σ is the continuity set C(f) of an ω-rational synchronous function f defined on Σω .