Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.


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)


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.