Two examples of translating an expression, arising from real problems, to canonical form are presented. The steps involved are: 1) construct that expression in domain-specific terms; 2) translate to a conjunction of functions; 3) translate to canonical form. Step 3) is usually straightforward. The first example is related to reconfigurable computing and is interesting because it is naturally expressed as a Quantified Boolean Formula (QBF) with one alternation, which is often a difficult problem to solve. The second example relates to formal verification.