The 19 papers presented in this volume were selected from a total of 44 submissions. Among the topics covered are: formal specification; automata theory; term rewriting and rewriting systems; process algebras; formal language theory; type theory; event structures; and iteration theory.

Generalizing domain theory.- A cook's tour of equational axiomatizations for prefix iteration.- The WHILE hierarchy of program schemes is infinite.- Analysis of a guard condition in type theory.- An event structure semantics for P/T contextual nets: Asymmetric event structures.- Pumping Lemmas for timed automata.- Asynchronous Observations of Processes.- Minor searching, normal forms of graph relabelling: Two applications based on enumerations by graph relabelling.- Partial metrics and co-continuous valuations.- Mobile ambients.- Rational term rewriting.- The appearance of big integers in exact real arithmetic based on Linear Fractional Transformations.- Net refinement by pullback rewriting.- On piecewise testable, starfree, and recognizable picture languages.- Functor categories and two-level languages.- Deciding properties for message sequence charts.- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.- Deterministic rational transducers and random sequences.- Resource based models for asynchrony.