The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7358422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs |
scientific article; zbMATH DE number 7358422 |
Statements
The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (English)
0 references
14 June 2021
0 references
0.90799487
0 references
0.90489316
0 references
0.88948476
0 references
0.8789113
0 references
0.8656608
0 references
0.85306144
0 references
0.85172707
0 references
0.8508374
0 references
0.84916216
0 references
0.84694135
0 references
