Key points are not available for this paper at this time.
This paper presents a set of mathematical and computational tools for manipulating and rea-soning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemis two-level formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.
Kaplan et al. (Thu,) studied this question.