Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages

Uproszczony widok
dc.abstract.enWe 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.
dc.affiliationUniwersytet Warszawski
dc.conference.countryLuksemburg
dc.conference.datefinish2021-04-01
dc.conference.datestart2021-03-27
dc.conference.placeLuksemburg
dc.conference.seriesFoundations of Software Science and Computational Structures
dc.conference.seriesFoundations of Software Science and Computational Structures
dc.conference.seriesshortcutFOSSACS
dc.conference.shortcutFoSSaCS 2021
dc.conference.weblinkhttps://etaps.org/2021/fossacs
dc.contributor.authorToruńczyk, Szymon
dc.contributor.authorLasota, Sławomir
dc.contributor.authorKlin, Bartosz
dc.date.accessioned2024-01-25T13:50:50Z
dc.date.available2024-01-25T13:50:50Z
dc.date.issued2021
dc.description.financePublikacja bezkosztowa
dc.identifier.doi10.1007/978-3-030-71995-1_19
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/113837
dc.identifier.weblinkhttps://www.springer.com/gp/book/9783030719944
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages365-384
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enData languages
dc.subject.enregister automata
dc.subject.endeterminizability
dc.subject.ende- terministic separability
dc.subject.ensets with atoms
dc.subject.enorbit-finite sets
dc.subject.ennominal sets
dc.titleNondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
dc.typeJournalArticle
dspace.entity.typePublication