Issue no. 1 Table of Contents

Special issue dedicated to the thirteenth “Journées Montoises d'Informatique Théorique”
On abelian versions of critical factorization theorem
Fewest repetitions in infinite binary words
An aperiodicity problem for multiwords
Multi-dimensional sets recognizable in all abstract numeration systems
Three complexity functions
On automatic infinite permutations
Rational base number systems for p-adic numbers
Morphisms preserving the set of words coding three interval exchange
Repetition thresholds for subdivided graphs and trees
On the product of balanced sequences
On abelian repetition threshold
Fixed points of endomorphisms of certain free products
On the structure of (-ε)-integers

Issue no. 2 Table of Contents

Foreword ICTCS 2010 special issue
Formal Methods to Improve Public Administration Business Processes
Equivalences and Congruences on Infinite Conway Games
A graphical representation of relational formulae with complementation
Easy lambda-terms are not always simple
On the size of transducers for bidirectional decoding of prefix codes

Issue no. 3 Table of Contents

Job shop scheduling with unit length tasks
Linear spans of optimal sets of frequency hopping sequences
On the decidability of semigroup freeness
On the joint 2-adic complexity of binary multisequences
Probabilistic operational semantics for the lambda calculus
Undecidability of infinite post correspondence problem for instances of size 8

Issue no. 4 Table of Contents

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
k-counting automata
Regularity of languages defined by formal series with isolated cut point
Normal forms for unary probabilistic automata
Affine Parikh automata
Generating Networks of Splicing Processors
On biautomata
String Assembling Systems
Superiority of one-way and realtime quantum machines