Geodesic

Sommaire du Fascicule no. 1

Special issue dedicated to the thirteenth “Journées Montoises d'Informatique Théorique”
p. 1
On abelian versions of critical factorization theorem
p. 3-15
Fewest repetitions in infinite binary words
p. 17-31
An aperiodicity problem for multiwords
p. 33-50
Multi-dimensional sets recognizable in all abstract numeration systems
p. 51-65
Three complexity functions
p. 67-76
On automatic infinite permutations
p. 77-85
Rational base number systems for p-adic numbers
p. 87-106
Morphisms preserving the set of words coding three interval exchange
p. 107-122
Repetition thresholds for subdivided graphs and trees
p. 123-130
On the product of balanced sequences
p. 131-145
On abelian repetition threshold
p. 147-163
Fixed points of endomorphisms of certain free products
p. 165-179
On the structure of (-ε)-integers
p. 181-200

Sommaire du Fascicule no. 2

Foreword ICTCS 2010 special issue
p. 201
Formal Methods to Improve Public Administration Business Processes
p. 203-229
Equivalences and Congruences on Infinite Conway Games
p. 231-259
A graphical representation of relational formulae with complementation
p. 261-289
Easy lambda-terms are not always simple
p. 291-314
On the size of transducers for bidirectional decoding of prefix codes
p. 315-328

Sommaire du Fascicule no. 3

Job shop scheduling with unit length tasks
p. 329-342
Linear spans of optimal sets of frequency hopping sequences
p. 343-354
On the decidability of semigroup freeness
p. 355-399
On the joint 2-adic complexity of binary multisequences
p. 401-412
Probabilistic operational semantics for the lambda calculus
p. 413-450
Undecidability of infinite post correspondence problem for instances of size 8
p. 451-457

Sommaire du Fascicule no. 4

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
p. 459-460
k-counting automata
p. 461-478
Regularity of languages defined by formal series with isolated cut point
p. 479-493
Normal forms for unary probabilistic automata
p. 495-510
Affine Parikh automata
p. 511-545
Generating Networks of Splicing Processors
p. 547-572
On biautomata
p. 573-592
String Assembling Systems
p. 593-613
Superiority of one-way and realtime quantum machines
p. 615-641