This paper introduces to the calculus of regular expressions, the operators of unconditional and conditional parallel replacement as an enhancement of the existing replace operator (Karttunen 1995). It defines a set of replacement expressions that concisely encode several alternate variations of the operation. Replace expressions denote regular relations, defined in terms of other regular-expression operators. The basic case is unconditional obligatory replacement. Different versions of conditional replacement allow the operation to be constrained by context. All described replacement operations are now included in the Xerox finite-state calculus.

