BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Janani Lakshmanan (University of Hawaii)
DTSTART:20241031T180000Z
DTEND:20241031T190000Z
DTSTAMP:20260423T021215Z
UID:OLS/163
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/163/">Ne
 w Measures of Automatic Complexity Arising from Quantum Logic</a>\nby Jana
 ni Lakshmanan (University of Hawaii) as part of Online logic seminar\n\n\n
 Abstract\nThe automatic complexity of finite words was introduced by Shall
 it and Wang (2001). It measures the complexity of a word $x$ as the minimu
 m number of states of a finite automaton that uniquely accepts $x$. Here\,
  an automaton $M$ uniquely accepts a word $x$ if $x$ is the only word of l
 ength $|x|$ accepted by $M$. Via the digraph representation of automata we
  can view the computation of this number of states as a problem of extrema
 l graph theory. A quantum version of automatic complexity was first studie
 d by Kjos-Hanssen (2017). In this talk\, we explore several new measures o
 f automatic complexity motivated by the geometric subspace structure of th
 e automata and the associated quantum logic. In keeping with the Hallowe'e
 n spirit\, We consider some generalizations of quantum finite automata wit
 h the application of an immortality constraint\, considering a family of a
 utomata without dead states.\n
LOCATION:https://researchseminars.org/talk/OLS/163/
END:VEVENT
END:VCALENDAR