The following pages link to Petri nets and szilard languages (Q4125805):
Displaying 15 items.
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- Recursivite et cônes rationnels fermés par intersection (Q1133331) (← links)
- Petri nets and regular languages (Q1158763) (← links)
- Algebraic structure of some stochastic discrete event systems, with applications (Q1180360) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- The context-freeness of the languages associated with vector addition systems is decidable (Q1193880) (← links)
- Learning semilinear sets from examples and via queries (Q1200804) (← links)
- A decidability theorem for a class of vector-addition systems (Q1216050) (← links)
- Computation sequence sets (Q1236890) (← links)
- Evolution and observation -- a non-standard way to generate formal languages (Q1885900) (← links)
- k-Petri Net Controlled Grammars (Q3540110) (← links)
- A normal form theorem for label grammars (Q3938522) (← links)
- (Q4190159) (← links)
- Generalized Nets as a Tool for the Modelling of Data Mining Processes (Q4558949) (← links)
- (Q5089315) (← links)
