The following pages link to (Q2911620):
Displayed 9 items.
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Interprocedural Reachability for Flat Integer Programs (Q2947875) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5015278) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- (Q5207052) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)