Models of computation: automata and processes

The two fields of automata theory and formal languages on the one hand, and concurrency theory on the other hand, have developed independently, but have a lot in common. The one is a basic model of computation that gives us notions like algorithm and computability, the other is a basic model of computation that in addition takes interaction into account. In the talk, I give you my definition of "Informatica" and discuss the integration of the two fields. I give you elements of a textbook I am writing for an undergraduate course on the foundations of computer science.  

hosted by