The following pages link to (Q5009430):
Displaying 6 items.
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
- Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
- (Q5019696) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
