Sommaire du Fascicule no. 1

ICTCS 09 Foreword
Idealized coinductive type systems for imperative object-oriented programs
Enumerated type semantics for the calculus of looping sequences
Hopcroft's algorithm and tree-like automata
Consensual languages and matching finite-state computations
An introduction to quantum annealing
The compositional construction of Markov processes II
Extending the lambda-calculus with unbind and rebind
Strategies to scan pictures with automata based on Wang tiles

Sommaire du Fascicule no. 2

An improved derandomized approximation algorithm for the max-controlled set problem
On the parameterized complexity of approximate counting
Unique decipherability in the additive monoid of sets of numbers
Normalization of edit sequences for text synchronization
Advice Complexity and Barely Random Algorithms

Sommaire du Fascicule no. 3

Deciding knowledge in security protocols under some e-voting theories
The Fibonacci automorphism of free Burnside groups
Locally catenative sequences and Turtle graphics
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
Construction of tree automata from regular expressions

Sommaire du Fascicule no. 4

In memoriam: Philippe Flajolet, the father of analytic combinatorics
The cyclicity problem for the images of Q-rational series
Some problems in automata theory which depend on the models of set theory
Square-root rule of two-dimensional bandwidth problem
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
Recursive algorithm for parity games requires exponential time
Closure properties of hyper-minimized automata
Corrigendum: On multiperiodic words