Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379): Difference between revisions

@@ Property / cites work @@
+Q3774929
@@ Property / cites work: Q3774929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4733426
@@ Property / cites work: Q4733426 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484362
@@ Property / cites work: Q3484362 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphes canoniques de graphes algébriques
@@ Property / cites work: Graphes canoniques de graphes algébriques / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of deciding bisimilarity of normed unary processes
+Normal rank
@@ Property / cites work @@
+CCS expressions, finite state processes, and three problems of equivalence
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907077
@@ Property / cites work: Q3907077 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank