\(L(A)=L(B)\)? A simplified decidability proof. (Q1603704): Difference between revisions

@@ Property / author @@
+Géraud Sénizergues
@@ Property / author: Géraud Sénizergues / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic approach to the Korenjak-Hopcroft algorithms
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+On equivalence of grammars through transformation trees
+Normal rank
@@ Property / cites work @@
+The equivalence problem for real-time DPDAs
@@ Property / cites work: The equivalence problem for real-time DPDAs / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic pushdown automata is decidable
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? decidability results from complete formal systems
+Normal rank
@@ Property / cites work @@
+Decidability of DPDA equivalence
@@ Property / cites work: Decidability of DPDA equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic finite-turn pushdown automata
+Normal rank