Nondeterministic and co-nondeterministic implies deterministic, for data languages.

Speaker(s)

Bartek Klin

Affiliation

MIM UW

Date

Dec. 2, 2020, 2:15 p.m.

Information about the event

online

Seminar

Seminar Automata Theory

---

I will explain why, if a data language and its complement are both recognized by non-deterministic register automata (without guessing), then they are both recognized by deterministic ones. The proof relies on the technology of sets with atoms. This is joint work with Sławek Lasota and Szymon Toruńczyk.

---