SEMIGROUPS, AUTOMATA AND LANGUAGES

Complete congruences on lattices of (existence) varieties, K. Auinger; on semilattice ordered involuted monoids of binary relations, D.A. Bredikhin; chains and superchains in w-semigroups, O. Carton and D. Perrin; the word problem for k-depth languages, A. Cherubini and P. San Pietro; a result on the dot-depth hierarchy for inverse monoids, D. Cowan; completing codes by Hajos factorizations of groups, C. de Felice; Sturmian words - new combinatorial results, A. de Luca; languages recognition on cellular automata, M. Delorme and J. Mazoyer; right and left P P-endomorphism monoids of free right acts, V. Fleischer and U. Knauer; maximal orders in semigroups, J.B. Fountain; congruences, automata and periodicities, D. Giammarresi et al; a respresentation theorem for coupled-context-free languages, G. Hotz and G. Pitsch; regular rewrite systems and automatic structures, J.F.P. Hudson; recognizability of zigzag languages and stack language, B. Le Saec et al; nonstandard congruences and lattices of pseudovarieties, V.A. Molchanov; complexity of finite aperiodic semigroups and star-free languages, C.L. Nehaniv; some decision problems related to the regularity of monoids, F. Otto; on a theorem of Y. Zalcstein, J.S. Ponizovskii; regular semigroups and semidirect products, M.B. Szendrei; e-varieties of regular semigroups, P.G. Trotter; covers in the lattices of semigroup varieties and pseudovarieties, M.V. Volkov; on the join of two pseudovarieties, M. Zeitoun; restrictive semigroups and sheaves, G.I. Zhitomirskiy.