BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260415T014226Z
UID:Seminar-pizza-1085@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Qiyi Tang:MAILTO:Qiyi.Tang@liverpool.ac.uk
DTSTART:20230317T130000
DTEND:20230317T140000
SUMMARY:Friday Lunch and Talk Series
DESCRIPTION:David Purser: Linear Recurrence Sequences, Weighted Automata and their Ambiguity\n\nThe classical Fibonacci sequence takes the sum of the previous two terms as its value at each step. In general, sequences that take a linear combination of the previous terms are linear recurrence sequences. Such sequences model the evolution of program variables in linear loops, that is, when each program variable is updated using a linear transformation. More generally we can consider weighted automata, which can apply different linear transformations at each step. The talk will give a gentle introduction to these models and look at some important problems in the field. One important property for the analysis of weighted automata is ambiguity: the number of accepting paths through the automaton for every word. We consider the unambiguisation problem, which asks whether there is an equivalent weighted automaton with at most a single run for every word.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1085
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR