I. Automata I: Finite State Machines -- Semilattices of Fault Semiautomata -- Thompson Languages -- On Some Special Classes of Regular Languages -- Synchronized Shuffle and Regular Languages -- Synchronization Expressions:Characterization Results and Implementation -- II. Automata II: More General Devices -- Uniformization of Rational Relations -- Tree-Walking Pebble Automata -- Counter Machines: Decision Problems and Applications -- On the Equivalence of Finite Substitutions and Transducers -- Complementation of Büchi Automata Revisited -- III. Automata with Multiplicities -- Languages Accepted by Integer Weighted Finite Automata -- A Power Series Approach to Bounded Languages -- Full Abstract Families of Tree Series I -- Linear Automata, Rational Series and a Theorem of Fine and Wilf -- IV. Formal Languages -- Numerical Parameters of Evolutionary Grammars -- Iterated GSM Mappings: A Collapsing Hierarchy -- On the Length of Words -- An Insertion into the Chomsky Hierarchy? -- Word Length Controlled DT0L Systems and Slender Languages -- V. Algorithms and Complexity -- Program-Size Complexity of Initial Segments and Domination Reducibility -- Stability of Approximation Algorithms and the Knapsack Problem -- Some Examples of Average-case Analysis by the Incompressibility Method -- Complexity of Language Recognition Problems for Compressed Words -- Algorithms on Continued Fractions -- VI. Combinatorics of Words -- On the Index of Sturmian Words -- Repetitions and Boxes in Words and Pictures -- Small Aperiodic Sets of Triangular and Hexagonal Tiles -- Quadratic Word Equations -- Fair and Associative Infinite Trajectories -- Forbidden Factors in Finite and Infinite Words -- VII. Novel Directions -- Reversible Molecular Computation in Ciliates -- Logic, Probability, and Rough Sets -- List of Contributors.