Computing the throughput of concatenation state machines (Q954952)
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 throughput of concatenation state machines |
scientific article; zbMATH DE number 5368268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the throughput of concatenation state machines |
scientific article; zbMATH DE number 5368268 |
Statements
Computing the throughput of concatenation state machines (English)
0 references
18 November 2008
0 references
concatenation state machine
0 references
And-Or graph
0 references
hyper-path mean weight
0 references
minimum cycle mean
0 references
0.7061327695846558
0 references
0.6821092367172241
0 references
0.6808683276176453
0 references
0.6764376163482666
0 references
