Sommaire du Fascicule no. 1

Series which are both max-plus and min-plus rational are unambiguous
p. 1-14
On Christoffel classes
p. 15-27
On a complete set of operations for factorizing codes
p. 29-52
Theories of orders on the set of words
p. 53-74
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
p. 75-91

Sommaire du Fascicule no. 2

Preface
p. v-xiii
Entropy generation in a model of reversible computation
p. 93-105
Increasing integer sequences and Goldbach's conjecture
p. 107-121
Eye localization for face recognition
p. 123-139
Complexity classes for membrane systems
p. 141-162
Characterization of lung tumor subtypes through gene expression cluster validity assessment
p. 163-176
Different time solutions for the firing squad synchronization problem on basic grid networks
p. 177-206
Probabilistic models for pattern statistics
p. 207-225
Graph fibrations, graph isomorphism, and pagerank
p. 227-253
Decision problems among the main subfamilies of rational relations
p. 255-275
Unambiguous recognizable two-dimensional languages
p. 277-293
On the simplest centralizer of a language
p. 295-301
String distances and intrusion detection : bridging the gap between formal languages and computer security
p. 303-313
Quantum finite automata with control language
p. 315-332
A survey on transitivity in discrete time dynamical systems. Application to symbolic systems and related languages
p. 333-352
Towards a theory of practice in metaheuristics design : a machine learning perspective
p. 353-369
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
p. 371-388
A distributed voting scheme to maximize preferences
p. 389-403

Sommaire du Fascicule no. 3

Foreword
p. 405
Well quasi-orders, unavoidable sets, and derivation systems
p. 407-426
A generator of morphisms for infinite words
p. 427-441
On possible growths of arithmetical complexity
p. 443-458
Transcendence of numbers with an expansion in a subclass of complexity 2n + 1
p. 459-471
Squares and overlaps in the Thue-Morse sequence and some variants
p. 473-484
Deterministic blow-ups of minimal NFA's
p. 485-499
Note on the complexity of Las Vegas automata problems
p. 501-510
A little more about morphic sturmian words
p. 511-518

Sommaire du Fascicule no. 4

Packing of (0, 1)-matrices
p. 519-535
Picture codes
p. 537-550
Undecidability of infinite post correspondence problem for instances of size 9
p. 551-557
The accessibility of an access structure
p. 559-567
Sequences of low arithmetical complexity
p. 569-582
On multiperiodic words
p. 583-591
Edit distance between unlabeled ordered trees
p. 593-609
Conversion of regular expressions into realtime automata
p. 611-629