Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BYCC-BY - Uznanie autorstwa
 

Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:09:19Z
dc.affiliationUniwersytet Warszawski
dc.conference.countryNiemcy
dc.conference.datefinish2021-03-19
dc.conference.datestart2021-03-16
dc.conference.placeSaarbrücken
dc.conference.seriesInternational Symposium on Theoretical Aspects of Computer Science
dc.conference.seriesInternational Symposium on Theoretical Aspects of Computer Science
dc.conference.seriesshortcutSTACS
dc.conference.shortcutSTACS 2021
dc.conference.weblinkhttps://stacs2021.saarland-informatics-campus.de/
dc.contributor.authorBarloy,
dc.contributor.authorClemente, Lorenzo
dc.date.accessioned2024-01-24T18:36:08Z
dc.date.available2024-01-24T18:36:08Z
dc.date.copyright2021-03-10
dc.date.issued2021
dc.description.accesstimeAT_PUBLICATION
dc.description.financePublikacja bezkosztowa
dc.description.versionFINAL_PUBLISHED
dc.identifier.doi10.4230/LIPICS.STACS.2021.8
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/102275
dc.identifier.weblinkhttps://drops.dagstuhl.de/opus/volltexte/2021/13653/
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages{8:1--8:15
dc.rightsCC-BY
dc.sciencecloudnosend
dc.titleBidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata
dc.typeJournalArticle
dspace.entity.typePublication