@article{KlinLasotaTorunczyk:FOSSACS:2021,
    Abstract = {We prove that if a data language and its complement are both recognized by nondeterministic register automata (without guessing), then they are also recognized by deterministic ones.},
    Author = {Klin, Bartek and Lasota, S{\l}awomir and Toru{\'n}czyk, Szymon},
    Date = {2021/03/23},
    Editor = {Kiefer, Stefan and Tasson, Christine},
    File = {Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages - Klin2021\_Chapter\_NondeterministicAndCo-Nondeter.pdf},
    Journal = {Proc. of FOSSACS'21},
    Keywords = {Data languages; register automata; determinizability; deterministic separability; sets with atoms; orbit-finite sets; nominal sets},
    Month = {03},
    Pages = {365--384},
    Title = {Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages},
    URL = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/},
    Volume = {12650},
    Year = {2021},
    an = {PMC7984108},
    bdsk-url-1 = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/},
    bdsk-url-2 = {https://doi.org/10.1007/978-3-030-71995-1\%7B\%5C\_\%7D19},
    date-added = {2021-04-06 14:37:00 +0200},
    date-modified = {2021-04-06 14:37:25 +0200},
    db = {PMC},
    j2 = {Foundations of Software Science and Computation Structures},
    l2 = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/},
    la = {eng},
    ty = {JOUR},
    u2 = {PMC7984108{$[$}pmcid{$]$}},
    doi = {10.1007/978-3-030-71995-1_19}
}

@article{KlinLasotaTorunczyk:FOSSACS:2021, Abstract = {We prove that if a data language and its complement are both recognized by nondeterministic register automata (without guessing), then they are also recognized by deterministic ones.}, Author = {Klin, Bartek and Lasota, S{\l}awomir and Toru{\'n}czyk, Szymon}, Date = {2021/03/23}, Editor = {Kiefer, Stefan and Tasson, Christine}, File = {Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages - Klin2021_Chapter_NondeterministicAndCo-Nondeter.pdf}, Journal = {Proc. of FOSSACS'21}, Keywords = {Data languages; register automata; determinizability; deterministic separability; sets with atoms; orbit-finite sets; nominal sets}, Month = {03}, Pages = {365--384}, Title = {Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages}, URL = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/}, Volume = {12650}, Year = {2021}, an = {PMC7984108}, bdsk-url-1 = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/}, bdsk-url-2 = {https://doi.org/10.1007/978-3-030-71995-1\%7B\%5C_\%7D19}, date-added = {2021-04-06 14:37:00 +0200}, date-modified = {2021-04-06 14:37:25 +0200}, db = {PMC}, j2 = {Foundations of Software Science and Computation Structures}, l2 = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/}, la = {eng}, ty = {JOUR}, u2 = {PMC7984108{$[$}pmcid{$]$}}, doi = {10.1007/978-3-030-71995-1_19} }