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

Regular Separability of One Counter Automata

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:06:30Z
dc.abstract.enThe regular separability problem asks, for two given languages, if there existsa regular language including one of them but disjoint from the other. Our main result isdecidability, andPSpace-completeness, of the regular separability problem for languages ofone counter automata without zero tests (also known as one counter nets). This contrastswith undecidability of the regularity problem for one counter nets, and with undecidabilityof the regular separability problem for one counter automata, which is our second result.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorLasota, Sławomir
dc.contributor.authorCzerwiński, Wojciech
dc.date.accessioned2024-01-25T19:09:28Z
dc.date.available2024-01-25T19:09:28Z
dc.date.issued2019
dc.description.financeNie dotyczy
dc.description.number2
dc.description.volume15
dc.identifier.doi10.23638/LMCS-15(2:20)2019
dc.identifier.issn1860-5974
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/118213
dc.identifier.weblinkhttps://lmcs.episciences.org/5563
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofLogical Methods in Computer Science
dc.relation.pages20:1–20:27
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleRegular Separability of One Counter Automata
dc.typeJournalArticle
dspace.entity.typePublication