A result on the equivalence problem for deterministic pushdown automata (Q1230509): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of deterministic top-down grammars
@@ Property / cites work: Properties of deterministic top-down grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
+Normal rank
@@ Property / cites work @@
+Deterministic one-counter automata
@@ Property / cites work: Deterministic one-counter automata / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic finite-turn pushdown automata
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(76)80049-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2030400253
@@ Property / OpenAlex ID: W2030400253 / rank @@
+Normal rank