The following pages link to Computation sequence sets (Q1236890):
Displaying 20 items.
- The unsolvability of some Petri net language problems (Q599503) (← links)
- Relations and functions in multiset context (Q1007881) (← 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)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- Analysis of Petri nets by stepwise refinements (Q1255320) (← links)
- An informal introduction to a high level language with applications to interval mathematics (Q1899457) (← links)
- Bidirectional comparison of multi-attribute qualitative objects (Q2195445) (← links)
- Infinite behaviour of Petri nets (Q2265817) (← links)
- On multiset group (Q3295223) (← links)
- A normal form theorem for label grammars (Q3938522) (← links)
- Verification of causal models using petri nets (Q4034400) (← links)
- (Q4170259) (← links)
- (Q4190159) (← links)
- (Q5019854) (← links)
- (Q5197728) (← links)
- Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
- On the theory of bags and lists (Q5946328) (← links)
