Some automata-theoretic properties of  -NFA

dc.contributor.author	Van Zijl, L
dc.contributor.author	Van der Walt, APJ
dc.date.accessioned	2018-06-14T10:12:06Z
dc.date.available	2018-06-14T10:12:06Z
dc.date.issued	1999
dc.identifier.citation	Van Zijl L & Van der Walt APJ (1999) Some automata-theoretic properties of -NFA. South African Computer Journal, Number 24, 1999	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/24377
dc.description.abstract	We prove that the shortest word accepted by an n-state intersection selective nondeterministic automaton with nonempty language can be of length O( e n log n).	en
dc.language.iso	en	en
dc.publisher	South African Computer Society (SAICSIT)	en
dc.subject	Nondeterminism	en
dc.subject	Automata theory	en
dc.title	Some automata-theoretic properties of -NFA	en
dc.type	Article	en