Picture of neon light reading 'Open'

Discover open research at Strathprints as part of International Open Access Week!

23-29 October 2017 is International Open Access Week. The Strathprints institutional repository is a digital archive of Open Access research outputs, all produced by University of Strathclyde researchers.

Explore recent world leading Open Access research content this Open Access Week from across Strathclyde's many research active faculties: Engineering, Science, Humanities, Arts & Social Sciences and Strathclyde Business School.

Explore all Strathclyde Open Access research outputs...

Minimization via duality

Bezhanishvili, N. and Kupke, C. and Panangaden, P. (2012) Minimization via duality. In: Logic, Language, Information and Computation. Lecture notes in computer science / Theoretical Computer Science and General Issues, 7456 LNCS . Springer, pp. 191-205. ISBN 9783642326202

[img] PDF
BezhanishviliKupkePanagadenDuality2012.pdf - Accepted Author Manuscript

Download (138kB)

Abstract

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.