Monday, June 26, 2017
Speaker: Wojciech Czerwiński
Venue: IST Austria
Monday, 17:00, Large Seminar Room in Office Building West
Languages K and L are separable by language S if K is included in S and L is disjoint from S.
I will present recent results on decidability of the problem whether two languages of one counter automata are separable
by some regular language.