Pages that link to "Item:Q2295623"
From MaRDI portal
The following pages link to Generating all minimal Petri net unsolvable binary words (Q2295623):
Displaying 5 items.
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- An efficient characterization of Petri net solvable binary words (Q2280188) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)