On the computational power of pushdown automata (Q2542990): Difference between revisions

@@ Property / author @@
-Jeffrey D. Ullman
@@ Property / author: Jeffrey D. Ullman / rank @@
-Normal rank
@@ Property / author @@
-John E. Hopcrofts
@@ Property / author: John E. Hopcrofts / rank @@
-Normal rank
@@ Property / author @@
+Jeffrey D. Ullman
@@ Property / author: Jeffrey D. Ullman / rank @@
+Normal rank
@@ Property / author @@
+John E. Hopcrofts
@@ Property / author: John E. Hopcrofts / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way pushdown automata
@@ Property / cites work: Two-way pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Time and tape complexity of pushdown automaton languages
+Normal rank
@@ Property / cites work @@
+Some Results on Tape-Bounded Turing Machines
@@ Property / cites work: Some Results on Tape-Bounded Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636862
@@ Property / cites work: Q5636862 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(70)80004-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2044283261
@@ Property / OpenAlex ID: W2044283261 / rank @@
+Normal rank