RTA is the major forum for the presentation of research on all aspects of rewriting. Topics of interest include:

Foundations: string, term, net and graph rewriting; higher-order rewriting; binding techniques; constrained rewriting and deduction; categorical and infinitary rewriting; stochastic rewriting; higher-dimensional rewriting; tree automata; confluence; termination; complexity; modularity; equational logic; universal algebra; rewriting logic; rewriting calculi.

Algorithmic aspects and implementation: strategies; matching; unification; anti-unification; narrowing; completion; parallel execution; certification of rewriting properties; abstract machines; automated (non)termination and confluence provers; automated complexity analysis; system descriptions.

Applications of rewriting: programming languages (functional, logic, object-oriented and other programming paradigms); type systems; program analysis, transformation and optimisation; rewriting models of programs; semantics; process calculi; functional calculi; explicit substitution; constraint solving; symbolic and algebraic computation; theorem proving; proof checking; system modelling; system synthesis and verification; XML queries and transformations; cryptographic protocols; security policies; system biology; linguistics; rewriting in education.