BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7991@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20151015T110000
DTEND;TZID=Europe/Paris:20151015T120000
DTSTAMP:20241120T205621Z
URL:https://www.i2m.univ-amu.fr/evenements/fibrations-of-tree-automata/
SUMMARY:Colin Riba (LIP\, ENS Lyon): Fibrations of Tree Automata
DESCRIPTION:Colin Riba: We propose a notion of morphism between tree automa
 ta based on game semantics. These morphisms are winning strategies on a sy
 nchronous restriction of the linear implication between acceptance games o
 f automata seen as simple games.\n\nOur setting allows in particular to de
 fine substitution functors based on a suitable notion of synchronous tree 
 function. This leads to split indexed categories\, and by restricting to t
 ree functions issued from maps on alphabets\, this gives a fibration of tr
 ee automata.\n\nThese fibrations can be equipped with a symmetric monoidal
  structure issued from the synchronous product of automata. Moreover\, a v
 ariant of the usual projection operation on automata leads to an existenti
 al quantification in the fibered sense.\n\nThanks to that structure\, we c
 an show that our notion of morphism is correct\, in the sense that it resp
 ects language inclusion\, and in a weaker sense also complete.\n\n
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 015/10/Colin_Riba.jpg
CATEGORIES:Séminaire,Logique et Interactions
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20150329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR