Computing the optimal IO sequences of a protocol in polynomial time (Q1183459)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the optimal IO sequences of a protocol in polynomial time |
scientific article; zbMATH DE number 33305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the optimal IO sequences of a protocol in polynomial time |
scientific article; zbMATH DE number 33305 |
Statements
Computing the optimal IO sequences of a protocol in polynomial time (English)
0 references
28 June 1992
0 references
IO sequence
0 references
finite-state machine
0 references
protocol conformance testing
0 references
protocol
0 references
0 references
0.84384495
0 references
0.8314984
0 references
0.83098245
0 references
0.83098227
0 references
0.8241722
0 references
0.82356715
0 references
0 references
