Table of contents

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