Pages that link to "Item:Q3447699"
From MaRDI portal
The following pages link to Integer Vector Addition Systems with States (Q3447699):
Displaying 20 items.
- Automata for unordered trees (Q515668) (← links)
- Algebraic program analysis (Q832153) (← links)
- On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- On Robot Games of Degree Two (Q2799175) (← links)
- Purely Catalytic P Systems over Integers and Their Generative Power (Q2975904) (← links)
- (Q5002811) (← links)
- (Q5009428) (← links)
- On Affine Reachability Problems (Q5089216) (← links)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States (Q5089288) (← links)
- (Q5155662) (← links)
- (Q5155664) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Reasoning about reversal-bounded counter machines (Q6599624) (← links)
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals (Q6649444) (← links)
- The complexity of soundness in workflow nets (Q6649450) (← links)
- The complexity of bidirected reachability in valence systems (Q6649456) (← links)
