Issue no. 1 Table of Contents

Learning deterministic regular grammars from stochastic samples in polynomial time
On the influence of the state encoding on OBDD-representations of finite state machines
On the average case complexity of some P-complete problems
Strongly locally testable semigroups with commuting idempotents and related languages
Calculs d'invariants primitifs de groupes finis
On-line finite automata for addition in some numeration systems

Issue no. 2 Table of Contents

On the complexity of the hidden weighted bit function for various BDD models
Undecidability of the equivalence of finite substitutions on regular language
On sequences defined by D0L power series
Construction of a deterministic ω-automaton using derivatives
Immunity and simplicity for exact counting and other counting classes
On the median-of-k version of Hoare’s selection algorithm
Communication complexity and lower bounds on multilective computations

Issue no. 3 Table of Contents

Unavoidable set : extension and reduction
Normalisation of the theory 𝐓 of Cartesian closed categories and conservativity of extensions mathbfT[x] of mathbfT
On existentially first-order definable languages and their relation to NP
There is no complete axiom system for shuffle expressions
Non-looping string rewriting
Lower space bounds for accepting shuffle languages

Issue no. 4-5 Table of Contents

Preface
ITA
Monotone (co)inductive types and positive fixed-point types
The μ-calculus alternation-depth hierarchy is strict on binary trees
Fixpoint alternation : arithmetic, transition systems, and the binary tree
Topologies, continuity and bisimulations
A note on negative tagging for least fixed-point formulae
A note on coinduction and weak bisimilarity for while programs
Final dialgebras : from categories to allegories
On distributive fixed-point expressions
A finite axiomatization of nondeterministic regular expressions
Rewriting on cyclic structures : equivalence between the operational and the categorical description

Issue no. 6 Table of Contents

Computing the Rabin index of a parity automaton
Call-by-value solvability
Universality of reversible hexagonal cellular automata