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 this page instead for the normal view: The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs |
scientific article |
Statements
The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (English)
0 references
14 June 2021
0 references
