Minimization via duality

Bezhanishvili, N. and Kupke, Clemens and Panangaden, Prakash; Ong, Luke and de Queiroz, Ruy, eds. (2012) Minimization via duality. In: Logic, Language, Information and Computation. Lecture Notes in Computer Science, 7456 . Springer, ARG, pp. 191-205. ISBN 9783642326202

[thumbnail of Bezhanishvili-etal-LNCS2012-Minimization-via-duality]
Text (Bezhanishvili-etal-LNCS2012-Minimization-via-duality)
Accepted Author Manuscript

Download (147kB)| Preview


    We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata. The basic idea is that instead of constructing a maximal quotient we go to the dual and look for a minimal subalgebra and then return to the original category. Duality ensures that the minimal subobject becomes the maximally quotiented object.