Pages that link to "Item:Q2822650"
From MaRDI portal
The following pages link to Characterising Petri Net Solvable Binary Words (Q2822650):
Displayed 5 items.
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Generating all minimal Petri net unsolvable binary words (Q2295623) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)