On the decidability of the reachability problem for GSPDIs
dc.date.accessioned | 2013-03-12T08:13:15Z | |
dc.date.available | 2013-03-12T08:13:15Z | |
dc.date.issued | 2007 | en_US |
dc.date.submitted | 2008-03-25 | en_US |
dc.identifier.uri | http://hdl.handle.net/10852/9856 | |
dc.language.iso | eng | en_US |
dc.relation.ispartof | Research report http://urn.nb.no/URN:NBN:no-35645 | en_US |
dc.relation.uri | http://urn.nb.no/URN:NBN:no-35645 | |
dc.title | On the decidability of the reachability problem for GSPDIs | en_US |
dc.type | Research report | en_US |
dc.date.updated | 2008-03-31 | en_US |
dc.creator.author | Schneider, Gerardo | en_US |
dc.subject.nsi | VDP::420 | en_US |
dc.identifier.urn | URN:NBN:no-18784 | en_US |
dc.type.document | Forskningsrapport | en_US |
dc.identifier.duo | 71136 | en_US |
dc.identifier.bibsys | 080489540 | en_US |
dc.identifier.fulltext | Fulltext https://www.duo.uio.no/bitstream/handle/10852/9856/1/Report359.pdf |
Files in this item
Appears in the following Collection
-
Institutt for informatikk [4944]