[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tse/BoydU91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hasan_Ural>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sylvia_C._Boyd>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F32.92918>
foaf:homepage <https://doi.org/10.1109/32.92918>
dc:identifier DBLP journals/tse/BoydU91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F32.92918 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tse>
rdfs:label On the Complexity of Generating Optimal Test Sequences. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hasan_Ural>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sylvia_C._Boyd>
swrc:number 9 (xsd:string)
swrc:pages 976-978 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tse/BoydU91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tse/BoydU91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tse/tse17.html#BoydU91>
rdfs:seeAlso <https://doi.org/10.1109/32.92918>
dc:subject protocol testing; communications protocols; maximal overlapping; test subsequences; polynomial time; FSM; finite state machine; optimal test sequence generation; OTSG problem; NP-complete; computational complexity; finite automata; program testing; protocols (xsd:string)
dc:title On the Complexity of Generating Optimal Test Sequences. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 17 (xsd:string)