A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053): Difference between revisions

@@ Property / author @@
-Jan Friso Groote
@@ Property / author: Jan Friso Groote / rank @@
-Normal rank
@@ Property / author @@
+Jan Friso Groote
@@ Property / author: Jan Friso Groote / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3774929
@@ Property / cites work: Q3774929 / 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 @@
+Actions speak louder than words: proving bisimilarity for context-free processes
+Normal rank
@@ Property / cites work @@
+Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
+Normal rank
@@ Property / cites work @@
+Q3907077
@@ Property / cites work: Q3907077 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90142-i
+Normal rank
@@ Property / OpenAlex ID @@
+W2008587618
@@ Property / OpenAlex ID: W2008587618 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1198053