Synchronization and homomorphisms


Wednesday 12 November 2008 h. 15:30, room 1BC/45
Pablo SPIGA (Ph.D. in Pure Math., Dip. Mat.)
"Synchronization and homomorphisms"

An automaton is a machine which can be in any of a set of internal states which cannot be directly observed. A synchronizing automaton is an automaton admitting a sequence of transitions which take the automaton from any state into a known state. In this talk we present some recent connections between synchronizing automatons, permutation groups and graph homomorphisms. All relevant definitions would be given during the talk.

Rif. int. C. Marastoni, T. Vargiolu, M. Dalla Riva

Download Seminario Dottorato