The topics included in these proceeding cover both mathematics and computer science. They include codes, free monoids, transformation semigroups, automata, formal languages, word problems, orders and combinatorics. Attention is paid to the algebraic theories of codes and rewriting systems - the key subjects that combine these two fields. The number of papers in the proceedings exceeds 45 and all papers have been refereed.
Counting factors in words, semidirect products and power semigroups, J. Almeida; languages and scanners, D. Beauquier and J.E. Pin; characterizations of Schutzenberger graphs, D. Cowan and N.R. Reilly; encoding images as words and languages, K. Culik and S. Dube; rewriting methods for world problems, N. Dershowits; Mobius functions and confluent semi-commutation, V. Diekert; rewritable groups and semigroups and structure theory of set addition, G.A. Freiman and B.M. Schein; rational relations with bounded delay, C. Frougny and J. Sakarovitch; systems of equations over finite sets of word and automata theory, J. Karhumaki; permutation and iteration conditions for semigroups, A. De Luca and S. Varricchio; some recent results on string-rewriting systems that are confluent on some congruence class, F. Otto; total orders on free groups and monoids, W.B. Powell; order, invariance and visibility, I. Rival; rational word functions - characterization and minimization, C. Reutenauer and M.P. Schutzenberger.