A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers
In this paper we consider the problems of canonisation and minimisation of subsequential transducer with output in an arbitrary monoid. We show that these problems can be efficiently solved for a large class of monoids that includes the free monoids, tropical monoid, and groups, and is closed under Cartesian Product. We describe this class of monoids in terms of five simple axioms. The first four of them seem to be natural. For the last one, we show that it is also necessary.
KeywordsSequential transducers Minimisation Canonisation Monoids
- 3.Daviaud, L., Reynier, P.A., Talbot, J.M.: A generalised twinning property for minimisation of cost register automata. In: Proceedings - Symposium on Logic in Computer Science, pp. 857–866 (2016)Google Scholar
- 8.Jardine, A., Chandlee, J., Eyraud, R., Heinz, J.: Very efficient learning of structured classes of subsequential functions from positive data. In: Proceedings of the 12th International Conference on Grammatical Inference, vol. 34, pp. 94–108 (2014)Google Scholar
- 12.Roche, E., Schabes, Y.: Introduction. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 1–66. MIT Press, Cambridge (1997)Google Scholar