Relationships between pushdown automata with counters and complexity classes (Q4118823): Difference between revisions

@@ Property / cites work @@
+Time and tape complexity of pushdown automaton languages
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+An efficient context-free parsing algorithm
@@ Property / cites work: An efficient context-free parsing algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way pushdown automata
@@ Property / cites work: Two-way pushdown automata / 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 the Computational Complexity of Algorithms
@@ Property / cites work: On the Computational Complexity of Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / 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 @@
+A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
+Normal rank
@@ Property / cites work @@
+Recognition and parsing of context-free languages in time n3
+Normal rank