Issue no. 1 Table of Contents

Preface
p. i-vii
The globals of pseudovarieties of ordered semigroups containing B 2 and an application to a problem proposed by Pin
p. 1-29
The pseudovariety of semigroups of triangular matrices over a finite field
p. 31-48
Hereditary properties of words
p. 49-65
Gate circuits in the algebra of transients
p. 67-91
On the number of dissimilar pfaffian orientations of graphs
p. 93-113
Similarity relations and cover automata
p. 115-123
Some decision problems on integer matrices
p. 125-131
Finding H-partitions efficiently
p. 133-144
The perfection and recognition of bull-reducible Berge graphs
p. 145-160
Some decompositions of Bernoulli sets and codes
p. 161-174
A sparse dynamic programming algorithm for alignment with non-overlapping inversions
p. 175-190
A note on the Size-Ramsey number of long subdivisions of graphs
p. 191-206
Episturmian morphisms and a Galois theorem on continued fractions
p. 207-215
How expressions can code for automata
p. 217-237
Some results on 𝒞-varieties
p. 239-262
Parity codes
p. 263-278
Krohn-Rhodes complexity pseudovarieties are not finitely based
p. 279-296
Imre Simon : an exceptional graduate student
p. 297-304
Algebraic and graph-theoretic properties of infinite n-posets
p. 305-322

Issue no. 2 Table of Contents

Hierarchies of weakly monotone restarting automata
p. 325-342
Integers with a maximal number of Fibonacci representations
p. 343-359
A metric for evaluating software architecture and communication models consistency
p. 361-390
Complexity results for prefix grammars
p. 391-401
Efficient simulation of synchronous systems by multi-speed systems
p. 403-419

Issue no. 3 Table of Contents

Foreword
p. 421-422
Denotational aspects of untyped normalization by evaluation
p. 423-453
Distance desert automata and the star height problem
p. 455-509
Adhesive and quasiadhesive categories
p. 511-545
Polynomials over the reals in proofs of termination : from theory to practice
p. 547-586
Bisimulation on speed : lower time bounds
p. 587-618

Issue no. 4 Table of Contents

The entropy of Łukasiewicz-languages
p. 621-639
Languages of finite words occurring infinitely many times in an infinite word
p. 641-650
Note sur les relations entre les racines d'un polynôme réductible
p. 651-659
Equality sets for recursively enumerable languages
p. 661-675
On maximal QROBDD's of boolean functions
p. 677-686
One-way communication complexity of symmetric boolean functions
p. 687-706