Geodesic

Sommaire du Fascicule no. 1

Preface
p. 1-2
Systems of parallel communicating restarting automata
p. 3-22
Reaction automata working in sequential manner
p. 23-38
Bidirectional string assembling systems
p. 39-59
On the classes of languages accepted by limited context restarting automata
p. 61-84
Transducing by observing length-reducing and painter rules
p. 85-105
On the invertibility of finite linear transducers
p. 107-125
Conditional Lindenmayer systems with subregular conditions: The non-extended case
p. 127-147

Sommaire du Fascicule no. 2

One-Rule Length-Preserving Rewrite Systems and Rational Transductions
p. 149-171
Incremental DFA minimisation
p. 173-186
On the state complexity of semi-quantum finite automata
p. 187-207
A Generalized Model of PAC Learning and its Applicability
p. 209-245

Sommaire du Fascicule no. 3

Special issue in the honor of the 14th “Journées Montoises d'Informatique Théorique”
p. 247
Connectedness of fractals associated with Arnoux-Rauzy substitutions
p. 249-266
Root clustering of words
p. 267-280
A general framework for the derivation of regular expressions
p. 281-305
Existence of an infinite ternary 64-abelian square-free word
p. 307-314
Abelian pattern avoidance in partial words
p. 315-339
Integers in number systems with positive and negative quadratic Pisot base
p. 341-367

Sommaire du Fascicule no. 4

Binary patterns in binary cube-free words: Avoidability and growth
p. 369-389
Bouquets of circles for lamination languages and complexities
p. 391-418
Finite repetition threshold for large alphabets
p. 419-430
Tree algebra of sofic tree languages
p. 431-451
The number of binary rotation words
p. 453-465
5-abelian cubes are avoidable on binary alphabets
p. 467-478