State Complexity of Basic Operations on Nondeterministic Finite Automata

dc.contributor.author	Holzer, Markus
dc.contributor.author	Kutrib, Martin
dc.date.accessioned	2022-09-12T09:38:39Z
dc.date.available	2003-08-21T08:49:53Z
dc.date.available	2022-09-12T09:38:39Z
dc.date.issued	2001
dc.identifier.uri	http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-12036
dc.identifier.uri	https://jlupub.ub.uni-giessen.de//handle/jlupub/7544
dc.identifier.uri	http://dx.doi.org/10.22029/jlupub-6978
dc.language.iso	en	de_DE
dc.relation.ispartofseries	IFIG Research Report; 0103 / 2001
dc.rights	In Copyright	*
dc.rights.uri	http://rightsstatements.org/page/InC/1.0/	*
dc.subject.ddc	ddc:004	de_DE
dc.title	State Complexity of Basic Operations on Nondeterministic Finite Automata	de_DE
dc.type	workingPaper	de_DE
local.affiliation	FB 07 - Mathematik und Informatik, Physik, Geographie	de_DE
local.opus.id	1203
local.opus.institute	Institut für Informatik, TU München ; Institut für Informatik, Universität Giessen	de_DE
local.opus.fachgebiet	Informatik	de_DE