Partially-Commutative Context-Free Processes (Q3184678): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-04081-8_18
+Normal rank
@@ Property / OpenAlex ID @@
+W1551945645
@@ Property / OpenAlex ID: W1551945645 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760246
@@ Property / cites work: Q2760246 / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation equivalence is decidable for all context-free processes
+Normal rank
@@ Property / cites work @@
+Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
+Normal rank
@@ Property / cites work @@
+Q4938637
@@ Property / cites work: Q4938637 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for deciding bisimilarity of normed context-free processes
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
+Normal rank
@@ Property / cites work @@
+Normed BPA vs. Normed BPP Revisited
@@ Property / cites work: Normed BPA vs. Normed BPP Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q4347161
@@ Property / cites work: Q4347161 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3184678