Q4146255 (Q4146255): Difference between revisions

@@ Property / cites work @@
+Time and tape complexity of pushdown automaton languages
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Translational lemmas, polynomial time, and \((\log n)^j\)-space
+Normal rank
@@ Property / cites work @@
+Comparing complexity classes
@@ Property / cites work: Comparing complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+An observation on time-storage trade off
@@ Property / cites work: An observation on time-storage trade off / rank @@
+Normal rank
@@ Property / cites work @@
+Q4199563
@@ Property / cites work: Q4199563 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5670175
@@ Property / cites work: Q5670175 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounded random access machines
@@ Property / cites work: Time bounded random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4053112
@@ Property / cites work: Q4053112 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardest Context-Free Language
@@ Property / cites work: The Hardest Context-Free Language / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-tape and multi-head pushdown automata
@@ Property / cites work: Multi-tape and multi-head pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+On non-determinacy in simple computing devices
@@ Property / cites work: On non-determinacy in simple computing devices / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+On two-way multihead automata
@@ Property / cites work: On two-way multihead automata / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4153609
@@ Property / cites work: Q4153609 / rank @@
+Normal rank
@@ Property / cites work @@
+Pushdown automata with counters
@@ Property / cites work: Pushdown automata with counters / rank @@
+Normal rank
@@ Property / cites work @@
+A note on computing time for recognition of languages generated by linear grammars
+Normal rank
@@ Property / cites work @@
+Q5180413
@@ Property / cites work: Q5180413 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131025
@@ Property / cites work: Q4131025 / rank @@
+Normal rank
@@ Property / cites work @@
+On tape-bounded complexity classes and multihead finite automata
+Normal rank
@@ Property / cites work @@
+Q4140411
@@ Property / cites work: Q4140411 / rank @@
+Normal rank
@@ Property / cites work @@
+General context-free recognition in less than cubic time
+Normal rank