Sommaire du Fascicule no. 1

Inf-datalog, modal logic and complexities
p. 1-21
Equations on partial words
p. 23-39
On critical exponents in fixed points of k-uniform binary morphisms
p. 41-68
Hyper-minimizing minimized deterministic finite state automata
p. 69-94
Hierarchies and reducibilities on regular languages related to modulo counting
p. 95-132
Cycle and path embedding on 5-ary N-cubes
p. 133-144
Palindromic complexity of infinite words associated with non-simple Parry numbers
p. 145-163
Least periods of factors of infinite words
p. 165-178

Sommaire du Fascicule no. 2

Repetitions and permutations of columns in the semijoin algebra
p. 179-187
On the power of randomization for job shop scheduling with k-units length tasks
p. 189-207
The theorem of Fine and Wilf for relational periods
p. 209-220
Minimal NFA and biRFSA languages
p. 221-237
A note on dual approximation algorithms for class constrained bin packing problems
p. 239-248
Thread algebra for noninterference
p. 249-268
Polynomial languages with finite antidictionaries
p. 269-279
Efficient validation and construction of border arrays and validation of string matching automata
p. 281-297
Directive words of episturmian words : equivalences and normalization
p. 299-319
Tree automata and automata on linear orderings
p. 321-338
Highly undecidable problems for infinite computations
p. 339-364
On context-free rewriting with a simple restriction and its computational completeness
p. 365-378
Nested sibling tree automata
p. 379-402

Sommaire du Fascicule no. 3

Episturmian words : a survey
p. 403-442
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part I
p. 443-461
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part II
p. 463-515
Dynamic overloading with copy semantics in object-oriented languages : a formal account
p. 517-565
Labeled shortest paths in digraphs with negative and positive edge weights
p. 567-583
Measuring the problem-relevant information in input
p. 585-613
Squares and cubes in sturmian sequences
p. 615-624
Inductive computations on graphs defined by clique-width expressions
p. 625-651
Left-to-right regular languages and two-way restarting automata
p. 653-665

Sommaire du Fascicule no. 4

On the proper intervalization of colored caterpillar trees
p. 667-686
Palindromes in infinite ternary words
p. 687-702
Two extensions of system 𝖥 with (co)iteration and primitive (co)recursion principles
p. 703-766
A note on the number of squares in a partial word with one hole
p. 767-774
Dejean’s conjecture holds for 𝖭≥27
p. 775-778
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
p. 779-790