Models of computation: automata and processes
2 April 2009
Automata theory and formal language theory is a basic model of computation addressing discrete behaviour, leading to important notions like computability and algorithm. Concurrency theory and process theory adds to this the notion of interaction between agents, essential when computers are always connected to each other and the world. The talk discusses integration of the two theories, and the benefits ensuing on both sides.
Refreshments will be served from 5.15pm.
The seminar is free of charge and open to everyone. If you would like to attend, please email Paul Boca by 27 March. Pre-registration is required, as security at the BCS Offices is tight.