Mag 162014
Upcoming Seminar Coinduction Up-To for Non Deterministic Automata May 21, 11.00 (Aula F) Palazzo delle Scienze - Cagliari Filippo Bonchi Ecole Normale Supérieure de Lyon - France Abstract. In this talk, I will introduce the Coinduction proof principle and its enhancements by mean of up-to techniques. I will introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Such technique can be effectively implemented in an algorithm that exponentially improves the state of the art. |