Sommaire du Fascicule no. 1

Series which are both max-plus and min-plus rational are unambiguous
On Christoffel classes
On a complete set of operations for factorizing codes
Theories of orders on the set of words
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Sommaire du Fascicule no. 2

Preface
Entropy generation in a model of reversible computation
Increasing integer sequences and Goldbach's conjecture
Eye localization for face recognition
Complexity classes for membrane systems
Characterization of lung tumor subtypes through gene expression cluster validity assessment
Different time solutions for the firing squad synchronization problem on basic grid networks
Probabilistic models for pattern statistics
Graph fibrations, graph isomorphism, and pagerank
Decision problems among the main subfamilies of rational relations
Unambiguous recognizable two-dimensional languages
On the simplest centralizer of a language
String distances and intrusion detection : bridging the gap between formal languages and computer security
Quantum finite automata with control language
A survey on transitivity in discrete time dynamical systems. Application to symbolic systems and related languages
Towards a theory of practice in metaheuristics design : a machine learning perspective
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
A distributed voting scheme to maximize preferences

Sommaire du Fascicule no. 3

Foreword
Well quasi-orders, unavoidable sets, and derivation systems
A generator of morphisms for infinite words
On possible growths of arithmetical complexity
Transcendence of numbers with an expansion in a subclass of complexity 2n + 1
Squares and overlaps in the Thue-Morse sequence and some variants
Deterministic blow-ups of minimal NFA's
Note on the complexity of Las Vegas automata problems
A little more about morphic sturmian words

Sommaire du Fascicule no. 4

Packing of (0, 1)-matrices
Picture codes
Undecidability of infinite post correspondence problem for instances of size 9
The accessibility of an access structure
Sequences of low arithmetical complexity
On multiperiodic words
Edit distance between unlabeled ordered trees
Conversion of regular expressions into realtime automata