On the Complexity of the Reachability Problem for Safe, Elementary Hornets

Köhler-Bußmeier, Michael

DC Element	Wert	Sprache
dc.contributor.author	Köhler-Bußmeier, Michael
dc.date.accessioned	2020-08-26T09:14:31Z	-
dc.date.available	2020-08-26T09:14:31Z	-
dc.date.issued	2014
dc.identifier.uri	http://hdl.handle.net/20.500.12738/811	-
dc.relation.ispartof	Fundamenta informaticae
dc.title	On the Complexity of the Reachability Problem for Safe, Elementary Hornets
dc.type	Article
tuhh.oai.show	true	en_US
tuhh.publication.institute	Department Informatik
tuhh.publication.institute	Fakultät Technik und Informatik
tuhh.type.opus	(wissenschaftlicher) Artikel	-
dc.type.casrai	Journal Article	-
dc.type.dini	article	-
dc.type.driver	article	-
dcterms.DCMIType	Text	-
item.fulltext	No Fulltext	-
item.creatorGND	Köhler-Bußmeier, Michael	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.creatorOrcid	Köhler-Bußmeier, Michael	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_6501	-
crisitem.author.dept	Department Informatik	-
crisitem.author.orcid	0000-0002-3074-4145	-
crisitem.author.parentorg	Fakultät Technik und Informatik	-
Enthalten in den Sammlungen:	Publications without full text