Sommaire du Fascicule no. 1

Preface
p. 1-4
Tree inclusion problems
p. 5-20
About the domino problem in the hyperbolic plane from an algorithmic point of view
p. 21-36
Exemples de classes d'automates cellulaires
p. 37-53
An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem
p. 55-68
A complete characterization of primitive recursive intensional behaviours
p. 69-82
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P. J. Cameron
p. 83-103
Arithmetization of the field of reals with exponentiation extended abstract
p. 105-119
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
p. 121-135
Weakly maximal decidable structures
p. 137-145
Computing the jth solution of a first-order query
p. 147-164
Learning discrete categorial grammars from structures
p. 165-182
On the continuity set of an Omega rational function
p. 183-196

Sommaire du Fascicule no. 2

Efficiency of automata in semi-commutation verification techniques
p. 197-215
Binary operations on automatic functions
p. 217-236
Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming
p. 237-252
Hierarchies of function classes defined by the first-value operator
p. 253-270
Calculi of net structures and sets are similar
p. 271-284
Efficient weighted expressions conversion
p. 285-307
Census algorithms for chinese remainder pseudorank
p. 309-322
Phenotype space and kinship assignment for the Simpson index
p. 323-333
State complexity of cyclic shift
p. 335-360
D0L sequence equivalence is in P for fixed alphabets
p. 361-374
A morphic approach to combinatorial games : the Tribonacci case
p. 375-393
On an algorithm to decide whether a free group is a free factor of another
p. 395-414

Sommaire du Fascicule no. 3

Preface
p. 415
A hierarchy of automatic ω-words having a decidable MSO theory
p. 417-450
Some algebraic properties of machine poset of infinite words
p. 451-466
From bi-ideals to periodicity
p. 467-475
Dejean's conjecture and letter frequency
p. 477-480
A new algebraic invariant for weak equivalence of sofic subshifts
p. 481-502
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
p. 503-524
Parikh test sets for commutative languages
p. 525-537
Compatibility relations on codes and free monoids
p. 539-552
A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous Min-Plus-automata
p. 553-581
On varieties of literally idempotent languages
p. 583-598
Drunken man infinite words complexity
p. 599-613
Traces of term-automatic graphs
p. 615-630
Two sided sand piles model and unimodal sequences
p. 631-646
Comparing complexity functions of a language and its extendable part
p. 647-655

Sommaire du Fascicule no. 4

Preface
p. 657
A note on univoque self-sturmian numbers
p. 659-662
Study of irreducible balanced pairs for substitutive languages
p. 663-678
On some problems related to palindrome closure
p. 679-700
On extremal properties of the Fibonacci word
p. 701-715
A hierarchy for circular codes
p. 717-728
Look and Say Fibonacci
p. 729-746
Periodicity problem of substitutions over ternary alphabets
p. 747-762