Name
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-71995-1_19 | FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021 |
Keywords | DocType | Volume |
Data languages, register automata, determinizability, deterministic separability, sets with atoms, orbit-finite sets, nominal sets | Conference | 12650 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bartek Klin | 1 | 0 | 1.01 |
| Slawomir Lasota | 2 | 0 | 0.34 |
| Szymon Torunczyk | 3 | 0 | 0.34 |