Sommaire du Fascicule no. 1

Preface
Tree inclusion problems
About the domino problem in the hyperbolic plane from an algorithmic point of view
Exemples de classes d'automates cellulaires
An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem
A complete characterization of primitive recursive intensional behaviours
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P. J. Cameron
Arithmetization of the field of reals with exponentiation extended abstract
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
Weakly maximal decidable structures
Computing the jth solution of a first-order query
Learning discrete categorial grammars from structures
On the continuity set of an Omega rational function

Sommaire du Fascicule no. 2

Efficiency of automata in semi-commutation verification techniques
Binary operations on automatic functions
Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming
Hierarchies of function classes defined by the first-value operator
Calculi of net structures and sets are similar
Efficient weighted expressions conversion
Census algorithms for chinese remainder pseudorank
Phenotype space and kinship assignment for the Simpson index
State complexity of cyclic shift
D0L sequence equivalence is in P for fixed alphabets
A morphic approach to combinatorial games : the Tribonacci case
On an algorithm to decide whether a free group is a free factor of another

Sommaire du Fascicule no. 3

Preface
A hierarchy of automatic ω-words having a decidable MSO theory
Some algebraic properties of machine poset of infinite words
From bi-ideals to periodicity
Dejean's conjecture and letter frequency
A new algebraic invariant for weak equivalence of sofic subshifts
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
Parikh test sets for commutative languages
Compatibility relations on codes and free monoids
A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous Min-Plus-automata
On varieties of literally idempotent languages
Drunken man infinite words complexity
Traces of term-automatic graphs
Two sided sand piles model and unimodal sequences
Comparing complexity functions of a language and its extendable part

Sommaire du Fascicule no. 4

Preface
A note on univoque self-sturmian numbers
Study of irreducible balanced pairs for substitutive languages
On some problems related to palindrome closure
On extremal properties of the Fibonacci word
A hierarchy for circular codes
Look and Say Fibonacci
Periodicity problem of substitutions over ternary alphabets