Decidability of bisimulation equivalence for normed pushdown processes (Q6104375): Difference between revisions

@@ Property / cites work @@
+Q3774929
@@ Property / cites work: Q3774929 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for process generating context-free languages
+Normal rank
@@ Property / cites work @@
+Q4847017
@@ Property / cites work: Q4847017 / 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 @@
+On the regular structure of prefix rewriting
@@ Property / cites work: On the regular structure of prefix rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4028125
@@ Property / cites work: Q4028125 / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation equivalence is decidable for all context-free processes
+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 @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942620
@@ Property / cites work: Q4942620 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of ends, pushdown automata, and second-order logic
+Normal rank
@@ Property / cites work @@
+The equivalence problem for real-time strict deterministic languages
+Normal rank