Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
Data publikacji
Abstrakt (EN)
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.
Dyscyplina PBN
informatyka
Strony od-do
365-384
Link do źródła
Licencja otwartego dostępu
Dostęp zamknięty