This paper discusses the generative capacity required for Semitic root-and-pattern morphology. Finite-state methods effectively compute concatenative morpho-phonology, and can be restricted to Strictly Local functions. We extend these methods to consider non-concatenative morphology. We show that over such multi-input functions, Strict Locality is necessary and sufficient. We discuss some consequences of this generalization for linguistic theories of the morphological template.