BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T233342Z
UID:Seminar-verification-1507@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20261001T110000
DTEND:20261001T120000
SUMMARY:Verification Series
DESCRIPTION:Di-de Yen: Hyper-Minimization for Deterministic Register Automata\n\nWe investigate hyper-minimization for deterministic register automata (DRAs). We begin by introducing DRA counterparts of classical notions from deterministic finite automata. Building on these foundations, we present an algorithm for hyper-minimizing well-typed DRAs, where each state is associated with a unique register type. The resulting automata are minimal with respect to both the number of states and registers among all well-typed DRAs. We prove the correctness of the proposed algorithm, thereby establishing the decidability of hyper-minimization for well-typed DRAs.\n\n\n\nJoint work with Yong Li and Qiyi Tang.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1507
LOCATION:Ashton 208
END:VEVENT
END:VCALENDAR