Sommaire du Fascicule no. 1

Inf-datalog, modal logic and complexities
Equations on partial words
On critical exponents in fixed points of k-uniform binary morphisms
Hyper-minimizing minimized deterministic finite state automata
Hierarchies and reducibilities on regular languages related to modulo counting
Cycle and path embedding on 5-ary N-cubes
Palindromic complexity of infinite words associated with non-simple Parry numbers
Least periods of factors of infinite words

Sommaire du Fascicule no. 2

Repetitions and permutations of columns in the semijoin algebra
On the power of randomization for job shop scheduling with k-units length tasks
The theorem of Fine and Wilf for relational periods
Minimal NFA and biRFSA languages
A note on dual approximation algorithms for class constrained bin packing problems
Thread algebra for noninterference
Polynomial languages with finite antidictionaries
Efficient validation and construction of border arrays and validation of string matching automata
Directive words of episturmian words : equivalences and normalization
Tree automata and automata on linear orderings
Highly undecidable problems for infinite computations
On context-free rewriting with a simple restriction and its computational completeness
Nested sibling tree automata

Sommaire du Fascicule no. 3

Episturmian words : a survey
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part I
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part II
Dynamic overloading with copy semantics in object-oriented languages : a formal account
Labeled shortest paths in digraphs with negative and positive edge weights
Measuring the problem-relevant information in input
Squares and cubes in sturmian sequences
Inductive computations on graphs defined by clique-width expressions
Left-to-right regular languages and two-way restarting automata

Sommaire du Fascicule no. 4

On the proper intervalization of colored caterpillar trees
Palindromes in infinite ternary words
Two extensions of system 𝖥 with (co)iteration and primitive (co)recursion principles
A note on the number of squares in a partial word with one hole
Dejean’s conjecture holds for 𝖭≥27
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata