Department Seminar Series
Separability problem
9th February 2016, 13:00
Ashton Lecture Theater
Dr Wojciech Czerwinski
University of Warsaw
Abstract
We say that language S separates languages K and L if S includes K, but has an empty intersection with L. Separability problem asks for two given languages from some family F1 whether there exists a language from a smaller family F2, which separates them.
I will sketch ideas behind some results concerning separability problem.
Department of Computer Science
,
University of Liverpool
Ashton Street, Liverpool, L69 3BX
United Kingdom
Ashton Street, Liverpool, L69 3BX
United Kingdom
+44 (0)151 795 4275
Call the department
+44 (0)151 795 4275