Q5009428 (Q5009428): Difference between revisions

@@ Property / cites work @@
+Regular combinators for string transformations
@@ Property / cites work: Regular combinators for string transformations / rank @@
+Normal rank
@@ Property / cites work @@
+Decision Problems for Additive Regular Functions
@@ Property / cites work: Decision Problems for Additive Regular Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Some decision problems related to the reachability problem for Petri nets
+Normal rank
@@ Property / cites work @@
+Unbounded-Thread Program Verification using Thread-State Equations
+Normal rank
@@ Property / cites work @@
+Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
+Normal rank
@@ Property / cites work @@
+Q5144614
@@ Property / cites work: Q5144614 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Positive Integral Solutions of Linear Diophantine Equations
+Normal rank
@@ Property / cites work @@
+BOUNDED PARIKH AUTOMATA
@@ Property / cites work: BOUNDED PARIKH AUTOMATA / rank @@
+Normal rank
@@ Property / cites work @@
+UNAMBIGUOUS CONSTRAINED AUTOMATA
@@ Property / cites work: UNAMBIGUOUS CONSTRAINED AUTOMATA / rank @@
+Normal rank
@@ Property / cites work @@
+The taming of the semi-linear set
@@ Property / cites work: The taming of the semi-linear set / rank @@
+Normal rank
@@ Property / cites work @@
+Q4219024
@@ Property / cites work: Q4219024 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4936148
@@ Property / cites work: Q4936148 / rank @@
+Normal rank
@@ Property / cites work @@
+An SMT-Based Approach to Coverability Analysis
@@ Property / cites work: An SMT-Based Approach to Coverability Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q4415251
@@ Property / cites work: Q4415251 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Vector Addition Systems with States
@@ Property / cites work: Integer Vector Addition Systems with States / rank @@
+Normal rank
@@ Property / cites work @@
+On the reachability problem for 5-dimensional vector addition systems
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+How hard is it to verify flat affine counter systems with the finite monoid property?
+Normal rank
@@ Property / cites work @@
+Parallel program schemata
@@ Property / cites work: Parallel program schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Finite Groups of Matrices Whose Entries Are Integers
+Normal rank
@@ Property / cites work @@
+On finite semigroups of matrices
@@ Property / cites work: On finite semigroups of matrices / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+Reachability in Petri Nets with Inhibitor Arcs
@@ Property / cites work: Reachability in Petri Nets with Inhibitor Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
+Normal rank