{"id":355,"date":"2014-05-16T15:02:51","date_gmt":"2014-05-16T14:02:51","guid":{"rendered":"http:\/\/sites.google.com\/feeds\/content\/site\/tcsunica\/2722071444054262519"},"modified":"2014-05-16T15:04:47","modified_gmt":"2014-05-16T14:04:47","slug":"seminar-coinduction-up-to-for-non-deterministic-automata","status":"publish","type":"post","link":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/2014\/05\/16\/seminar-coinduction-up-to-for-non-deterministic-automata\/","title":{"rendered":"Seminar: Coinduction Up-To for Non Deterministic Automata"},"content":{"rendered":"
\n\n\n\n
\n
\n
\n
\n
Upcoming Seminar<\/span>
<\/span><\/font><\/span><\/div>\n<\/div>\n

<\/span><\/font><\/span>Coinduction Up-To for Non Deterministic Automata<\/b><\/p>\n

May 21, 11.00 (Aula F)
Palazzo delle Scienze – Cagliari
<\/span><\/font><\/span><\/div>\n<\/div>\n


<\/span><\/span><\/font><\/span><\/p>\n
Filippo Bonchi<\/b><\/font>
<\/span><\/b><\/span><\/font><\/span><\/div>\n<\/div>\n
\n
Ecole Normale Sup\u00e9rieure de Lyon – France<\/span><\/font><\/div>\n<\/div>\n



Abstract.<\/b><\/span><\/font><\/span> <\/span><\/font><\/span><\/font>In this talk, I will introduce the Coinduction proof principle and its enhancements by mean of up-to techniques.
\nI will introduce bisimulation up to congruence as a technique for
\nproving language equivalence of non-deterministic finite automata. Such
\ntechnique can be effectively implemented in an algorithm that
\nexponentially improves the state of the art.<\/font><\/span><\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n","protected":false},"excerpt":{"rendered":"\n\n\n
\n
\n
\n
\n
Upcoming Seminar<\/span>
<\/span><\/span><\/div>\n<\/div>\n

<\/span><\/span>Coinduction Up-To for Non Deterministic Automata<\/b><\/p>\n

May 21, 11.00 (Aula F)
Palazzo delle Scienze – Cagliari
<\/span><\/span><\/div>\n<\/div>\n


<\/span><\/span><\/span><\/p>\n
Filippo Bonchi<\/b>
<\/span><\/b><\/span><\/span><\/div>\n<\/div>\n
\n
Ecole Normale Supérieure de Lyon – France<\/span><\/div>\n<\/div>\n



Abstract.<\/b><\/span><\/span> <\/span><\/span>In this talk, I will introduce the Coinduction proof principle and its enhancements by mean of up-to techniques.
\nI will introduce bisimulation up to congruence as a technique for
\nproving language equivalence of non-deterministic finite automata. Such
\ntechnique can be effectively implemented in an algorithm that
\nexponentially improves the state of the art.<\/span><\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"author":1325,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[13],"tags":[],"class_list":["post-355","post","type-post","status-publish","format-standard","hentry","category-httpschemas-google-comsites2008announcement","category-13-id","post-seq-1","post-parity-odd","meta-position-corners","fix"],"_links":{"self":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/355","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/users\/1325"}],"replies":[{"embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/comments?post=355"}],"version-history":[{"count":1,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/355\/revisions"}],"predecessor-version":[{"id":356,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/355\/revisions\/356"}],"wp:attachment":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/media?parent=355"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/categories?post=355"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/tags?post=355"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}