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

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.