The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1911.05834 / rank | |||
Normal rank | |||
Revision as of 00:08, 19 April 2024
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
