The following pages link to (Q4136592):
Displaying 10 items.
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Simple counter machines and number-theoretic problems (Q1136223) (← links)
- On the reachability problem for 5-dimensional vector addition systems (Q1155361) (← links)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Some decision problems related to the reachability problem for Petri nets (Q1235983) (← links)
- The equality problem for vector addition systems is undecidable (Q1238997) (← links)
- Catalytic P systems, semilinear sets, and vector addition systems (Q1884955) (← links)
- (Q4190159) (← links)
