The equivalence problem for deterministic pushdown automata is decidable (Q4571996): 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/3-540-63165-8_221
+Normal rank
@@ Property / OpenAlex ID @@
+W1518704718
@@ Property / OpenAlex ID: W1518704718 / rank @@
+Normal rank
@@ Property / cites work @@
+An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
+Normal rank
@@ Property / cites work @@
+An axiomatic approach to the Korenjak-Hopcroft algorithms
+Normal rank
@@ Property / cites work @@
+Deterministic context free languages
@@ Property / cites work: Deterministic context free languages / rank @@
+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 @@
+Q4818837
@@ Property / cites work: Q4818837 / rank @@
+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 @@
+Decidability of bisimulation equivalence for normed pushdown processes
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic finite-turn pushdown automata
+Normal rank
@@ Property / cites work @@
+Deterministic one-counter automata
@@ Property / cites work: Deterministic one-counter automata / rank @@
+Normal rank