On reachability equivalence for BPP-nets (Q1391745): Difference between revisions

@@ Property / cites work @@
+Q3142557
@@ Property / cites work: Q3142557 / rank @@
+Normal rank
@@ Property / cites work @@
+Petri nets, commutative context-free grammars, and basic parallel processes
+Normal rank
@@ Property / cites work @@
+Q4289279
@@ Property / cites work: Q4289279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4525284
@@ Property / cites work: Q4525284 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4490743
@@ Property / cites work: Q4490743 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3668872
@@ Property / cites work: Q3668872 / rank @@
+Normal rank
@@ Property / cites work @@
+Commutative grammars: The complexity of uniform word problems
+Normal rank
@@ Property / cites work @@
+The complexity of equivalence problems for commutative grammars
+Normal rank
@@ Property / cites work @@
+Q4727433
@@ Property / cites work: Q4727433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3911403
@@ Property / cites work: Q3911403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3670575
@@ Property / cites work: Q3670575 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Normal Petri nets
@@ Property / cites work: Normal Petri nets / rank @@
+Normal rank