Sommaire du Fascicule no. 1

Preface

Choffrut, Christian ; Colson, Loïc

p. 1-4
Tree inclusion problems

Cégielski, Patrick ; Guessarian, Irène ; Matiyasevich, Yuri

p. 5-20
About the domino problem in the hyperbolic plane from an algorithmic point of view

Margenstern, Maurice

p. 21-36
Exemples de classes d'automates cellulaires

Delorme, Marianne ; Mazoyer, Jacques

p. 37-53
An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem

Yunès, Jean-Baptiste

p. 55-68
A complete characterization of primitive recursive intensional behaviours

Valarcher, P.

p. 69-82
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P. J. Cameron

Pouzet, Maurice

p. 83-103
Arithmetization of the field of reals with exponentiation extended abstract

Boughattas, Sedki ; Ressayre, Jean-Pierre

p. 105-119
Deciding whether a relation defined in Presburger logic can be defined in weaker logics

Choffrut, Christian

p. 121-135
Weakly maximal decidable structures

Bès, Alexis ; Cégielski, Patrick

p. 137-145
Computing the jth solution of a first-order query

Bagan, Guillaume ; Durand, Arnaud ; Grandjean, Etienne ; Olive, Frédéric

p. 147-164
Learning discrete categorial grammars from structures

Besombes, Jérôme ; Marion, Jean-Yves

p. 165-182
On the continuity set of an Omega rational function

Carton, Olivier ; Finkel, Olivier ; Simonnet, Pierre

p. 183-196

Sommaire du Fascicule no. 2

Efficiency of automata in semi-commutation verification techniques

Cécé, Gérard ; Héam, Pierre-Cyrille ; Mainier, Yann

p. 197-215
Binary operations on automatic functions

Karhumäki, Juhani ; Kari, Jarkko ; Kupke, Joachim

p. 217-236
Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming

Serna, Maria ; Xhafa, Fatos

p. 237-252
Hierarchies of function classes defined by the first-value operator

Hemmerling, Armin

p. 253-270
Calculi of net structures and sets are similar

Czaja, Ludwik

p. 271-284
Efficient weighted expressions conversion

Ouardi, Faissal ; Ziadi, Djelloul

p. 285-307
Census algorithms for chinese remainder pseudorank

Laing, David ; Litow, Bruce

p. 309-322
Phenotype space and kinship assignment for the Simpson index

Litow, Bruce ; Konovalov, Dmitry

p. 323-333
State complexity of cyclic shift

Jirásková, Galina ; Okhotin, Alexander

p. 335-360
D0L sequence equivalence is in P for fixed alphabets

Ruohonen, Keijo

p. 361-374
A morphic approach to combinatorial games : the Tribonacci case

Duchêne, Eric ; Rigo, Michel

p. 375-393
On an algorithm to decide whether a free group is a free factor of another

Silva, Pedro V. ; Weil, Pascal

p. 395-414

Sommaire du Fascicule no. 3

Preface

Caucal, Didier ; Siegel, Anne

p. 415
A hierarchy of automatic ω-words having a decidable MSO theory

Bárány, Vince

p. 417-450
Some algebraic properties of machine poset of infinite words

Belovs, Aleksandrs

p. 451-466
From bi-ideals to periodicity

Buls, Jānis ; Lorencs, Aivars

p. 467-475
Dejean's conjecture and letter frequency

Chalopin, Jérémie ; Ochem, Pascal

p. 477-480
A new algebraic invariant for weak equivalence of sofic subshifts

Chaubard, Laura ; Costa, Alfredo

p. 481-502
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid

Giambruno, Laura ; Restivo, Antonio

p. 503-524
Parikh test sets for commutative languages

Holub, Štěpán

p. 525-537
Compatibility relations on codes and free monoids

Kärki, Tomi

p. 539-552
A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous Min-Plus-automata

Kirsten, Daniel

p. 553-581
On varieties of literally idempotent languages

Klíma, Ondřej ; Polák, Libor

p. 583-598
Drunken man infinite words complexity

Gonidec, Marion Le

p. 599-613
Traces of term-automatic graphs

Meyer, Antoine

p. 615-630
Two sided sand piles model and unimodal sequences

Thi Ha Duong Phan

p. 631-646
Comparing complexity functions of a language and its extendable part

Shur, Arseny M.

p. 647-655

Sommaire du Fascicule no. 4

Preface

Berstel, J. ; Harju, T. ; Karhumäki, J.

p. 657
A note on univoque self-sturmian numbers

Allouche, Jean-Paul

p. 659-662
Study of irreducible balanced pairs for substitutive languages

Bernat, Julien

p. 663-678
On some problems related to palindrome closure

Bucci, Michelangelo ; Luca, Aldo de ; Luca, Alessandro De ; Zamboni, Luca Q.

p. 679-700
On extremal properties of the Fibonacci word

Cassaigne, Julien

p. 701-715
A hierarchy for circular codes

Pirillo, Giuseppe

p. 717-728
Look and Say Fibonacci

Séébold, Patrice

p. 729-746
Periodicity problem of substitutions over ternary alphabets

Tan, Bo ; Wen, Zhi-Ying

p. 747-762