A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934): Difference between revisions

@@ Property / cites work @@
+Decidability of bisimulation equivalence for process generating context-free languages
+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 @@
+Q3142557
@@ Property / cites work: Q3142557 / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of the decidability of bisimulation for normed BPA- processes
+Normal rank
@@ Property / cites work @@
+Undecidable equivalences for basic process algebra
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete
+Normal rank
@@ Property / cites work @@
+Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
+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