DCFS 2012

14th International Workshop on Descriptional Complexity of Formal Systems

Invited Speakers
Stacks Image 112
Christos Kapoutsis

Christos A. Kapoutsis received his PhD in Computer Science from MIT in 2006, for work on the size complexity of finite automata. Since then, he has spent time at ETH-Zurich as postdoctoral researcher and at University of Cyprus as visiting lecturer. Since September 2010, he is a Marie Curie fellow at LIAFA, working on a two-year project called “Minicomplexity”, for the systematic development of a complexity theory for two-way finite automata and size.
Stacks Image 121
Dexter Kozen

Dexter Kozen is Joseph Newton Pew, Jr. Professor in Engineering at Cornell University, USA. He is well-known for his contributions on complexity and logic, namely in dynamic logic, mu-calculus and Kleene algebra. He is a Fellow of the Association of Computing Machinery, aGuggenheim Fellow, and has received a Outstanding Innovation Award from IBM Corporation. He is the author of several textbooks on the theory of computation, automata theory, dynamic logic, and algorithms. His research interests include the theory of computational complexity, especially complexity of decision problems in logic and algebra, automata and languages, logics and semantics of programming languages, and computer security.
Stacks Image 118
André Platzer

André Platzer is an Assistant Professor in the Computer Science Department at Carnegie Mellon University, Pittsburgh, PA, USA. His interests include logic in computer science, hybrid systems, distributed hybrid systems, automated theorem proving, model checking, symbolic and numerical computation. He published a book on "Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics", which is based on his Ph.D. obtained in 2008. Recently, he has introduced the first formal verification approach for distributed hybrid systems, in which participants can appear and disappear dynamically while the system follows its hybrid dynamics.
Stacks Image 115
Pedro Silva

Pedro V. Silva is a full professor at the Department of Mathematics, Faculty of Sciences of the University of Porto. His research interests include combinatorial group theory, combinatorial semigroup theory, inverse semigroups, language and automata theory, and combinatorics on words. His main contribution over the years has been the development of various automata-theoretic methods to solve problems in combinatorial (semi)group theory, particularly of an algorithmic nature. He is a co-author (together with Laurent Bartholdi) of the two chapters of the soon to be published Handbook on Automata and Applications devoted to the applications of automata theory to group theory.