Time complexity of loop-free two-way pushdown automata (Q1838833): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(83)90063-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2044199853
@@ Property / OpenAlex ID: W2044199853 / rank @@
+Normal rank
@@ Property / cites work @@
+Time and tape complexity of pushdown automaton languages
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3919065
@@ Property / cites work: Q3919065 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving programs by the introduction of recursion
+Normal rank
@@ Property / cites work @@
+Q4144216
@@ Property / cites work: Q4144216 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two-way nondeterministic pushdown automata
+Normal rank
@@ Property / cites work @@
+An effective simulation of deterministic pushdown automata with many two- way and one-way heads
+Normal rank
@@ Property / cites work @@
+General context-free recognition in less than cubic time
+Normal rank