The following pages link to (Q5184424):
Displaying 5 items.
- On sets of numbers accepted by P/T systems composed by join (Q410705) (← links)
- On capacity of labeled Petri net languages (Q1970061) (← links)
- An efficient characterization of Petri net solvable binary words (Q2280188) (← links)
- Deterministic weak-and-marked Petri net languages are regular (Q3124464) (← links)
- Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data (Q3564891) (← links)