BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T205219Z
UID:Seminar-dept-1293@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20251111T130000
DTEND:20251111T140000
SUMMARY:School Seminar Series
DESCRIPTION:Luca Prigioniero: Descriptional Complexity of Models for Regular Languages\n\nFinite automata are classical machines used to recognise regular languages. However, a variety of alternative models are also known to characterise this class. In many cases, these alternative devices can represent regular languages much more concisely than classical recognisers.\n\n\n\nIn this talk, I will present an overview of such models and their capacity to capture regular languages in a compact way. I will focus on selected devices and their properties, discussing recent results as well as open problems in the area.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1293
LOCATION:ELEC201, 2th Floor Lecture Theater EEE
END:VEVENT
END:VCALENDAR