Volume 43 (2009) no. 2

Table of contents

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