BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Recognisably context-free subsets of groups - Alex Levine\, Manche
 ster
DTSTART:20240119T134500Z
DTEND:20240119T144500Z
UID:TALK208273@talks.cam.ac.uk
CONTACT:Francesco Fournier-Facio
DESCRIPTION:A subset E of a finitely generated group is called recognisabl
 y context-free if the set of all words over a finite generating set that r
 epresent elements in E forms a context-free language. This property does n
 ot depend on the choice of generating set. A theorem of Muller and Schupp 
 fully classifies when the set {1} can be recognisably context-free\, and s
 ignificant efforts have been devoted to showing that in various classes of
  groups\, the complement of {1} is recognisably context-free. We present s
 ome recent results in this area studying when finite sets\, conjugacy clas
 ses and cosets can be recognisably context-free.
LOCATION:MR13
END:VEVENT
END:VCALENDAR