Factorizing Finite Automata: The Holonomy Decomposition

Speaker: Attila Egri-Nagy

Affiliation: University of Western Sydney

Time: Monday 08/09/2014 from 14:00 to 15:00

Venue: Access Grid UWS. Presented from Parramatta (EB.1.32), accessible from Campbelltown (26.1.50) and Penrith (Y239).

Abstract: Similar to the prime factorization of integers, finite automata can also be decomposed into indivisible building blocks. The holonomy algorithm is one such decomposition method. Though it is not a simple technique, recent advances in computational implementations improved our understanding of the algorithm and now it is possible to give an intuitive introduction.

Biography: Attila Egri-Nagy is a postdoctoral research fellow of CRM working on the applications of abstract algebra in biological problems.