A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053): Difference between revisions

@@ Property / cites work @@
+Q3727408
@@ Property / cites work: Q3727408 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484362
@@ Property / cites work: Q3484362 / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic approach to the Korenjak-Hopcroft algorithms
+Normal rank
@@ Property / cites work @@
+Completeness results for the equivalence of recursive schemas
+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 @@
+A direct algorithm for checking equivalence of LL(k) grammars
+Normal rank
@@ Property / cites work @@
+The decidability of equivalence for deterministic stateless pushdown automata
+Normal rank
@@ Property / cites work @@
+An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
+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