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

Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:38:13Z
dc.affiliationUniwersytet Warszawski
dc.conference.seriesInternational Colloquium on Automata Languages and Programming
dc.conference.seriesInternational Colloquium on Automata Languages and Programming
dc.conference.seriesshortcutICALP
dc.conference.shortcutICALP 2018
dc.contributor.authorLasota, Sławomir
dc.contributor.authorClemente, Lorenzo
dc.date.accessioned2024-01-24T18:38:35Z
dc.date.available2024-01-24T18:38:35Z
dc.date.issued2018
dc.description.financeNie dotyczy
dc.description.versionORIGINAL_AUTHOR
dc.identifier.doi10.4230/LIPICS.ICALP.2018.118
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/102303
dc.pbn.affiliationcomputer and information sciences
dc.rightsCC-BY
dc.sciencecloudnosend
dc.titleBinary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms
dc.typeJournalArticle
dspace.entity.typePublication