Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids

Abstract. We generalize the classical Myhill-Nerode theorem for finite automata to the setting of sequential transducers over unique GCDmonoids, which are cancellative monoids in which every two non-zero elements admit a unique greatest common (left) divisor. We prove that a given formal power series is sequential, if and only if it is directed and our Myhill-Nerode equivalence relation has finite index. As in the classical case, our Myhill-Nerode equivalence relation also admits the construction of a minimal (with respect to the number of states) sequential transducer recognizing the given formal power series. Deterministic finite automata and sequential transducers are applied, for example, in lexical analysis, digital image manipulation, and speech processing [2]. In the latter application area also very large sequential transducers, i.e., transducers having several million states, over various monoids are encountered [2], so without minimization algorithms [4] the applicability of sequential transducers would be severely hampered. In [2, 3] efficient algorithms for the minimization of sequential transducers are presented in case the weight is taken out of the monoid ( ∆ ∗ , ·, ε) or out of the monoid (IR +, +, 0). A Myhill-Nerode theorem also allowing minimization is well-known for sequential transducers over groups [1]. We use (A, ⊙, 1, 0) to denote a monoid with the absorbing element 0. A unique GCD-monoid is a cancellation monoid (A, ⊙, 1, 0) in which (i) a|1 implies a = 1, (ii) a greatest common divisor (gcd) exists for every two non-zero elements, and (iii) a least common multiple (lcm) exists for every two non-zero elements having a common multiple. Unique GCDmonoids exist in abundance (e.g., (IN ∪ {∞}, +, 0, ∞) and (IN, ·, 1, 0) as well as the monoids mentioned in the previous paragraph)