Sommaire du Fascicule no. 1

Preface
Systems of parallel communicating restarting automata
Reaction automata working in sequential manner
Bidirectional string assembling systems
On the classes of languages accepted by limited context restarting automata
Transducing by observing length-reducing and painter rules
On the invertibility of finite linear transducers
Conditional Lindenmayer systems with subregular conditions: The non-extended case

Sommaire du Fascicule no. 2

One-Rule Length-Preserving Rewrite Systems and Rational Transductions
Incremental DFA minimisation
On the state complexity of semi-quantum finite automata
A Generalized Model of PAC Learning and its Applicability

Sommaire du Fascicule no. 3

Special issue in the honor of the 14th “Journées Montoises d'Informatique Théorique”
Connectedness of fractals associated with Arnoux-Rauzy substitutions
Root clustering of words
A general framework for the derivation of regular expressions
Existence of an infinite ternary 64-abelian square-free word
Abelian pattern avoidance in partial words
Integers in number systems with positive and negative quadratic Pisot base

Sommaire du Fascicule no. 4

Binary patterns in binary cube-free words: Avoidability and growth
Bouquets of circles for lamination languages and complexities
Finite repetition threshold for large alphabets
Tree algebra of sofic tree languages
The number of binary rotation words
5-abelian cubes are avoidable on binary alphabets