BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Antonio Casares Santos (University of Kaiserslautern-Landau)
DTSTART:20251217T140000Z
DTEND:20251217T150000Z
DTSTAMP:20260423T052808Z
UID:FLAT/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/FLAT/16/">Tr
 ansition-based vs. state-based acceptance for automata over infinite words
 </a>\nby Antonio Casares Santos (University of Kaiserslautern-Landau) as p
 art of One FLAT World Seminar\n\n\nAbstract\nIn the context of automata ov
 er infinite words\, acceptance is traditionally defined in terms of the st
 ates visited infinitely often during a run. However\, there is a growing t
 rend towards defining acceptance based on transitions rather than states.\
 n\nIn this talk\, I will survey a number of results showing the striking d
 ifferences between the two models\, and provide arguments in favour of usi
 ng transitions as the standard acceptance method. Along the way\, we will 
 revisit key historical results that have shaped the theory of automata ove
 r infinite words.\n
LOCATION:https://researchseminars.org/talk/FLAT/16/
END:VEVENT
END:VCALENDAR