Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981): Difference between revisions

@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Checking automata and one-way stack languages
@@ Property / cites work: Checking automata and one-way stack languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q3766852
@@ Property / cites work: Q3766852 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating Pushdown and Stack Automata
@@ Property / cites work: Alternating Pushdown and Stack Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation bounded auxiliary pushdown automata
@@ Property / cites work: Alternation bounded auxiliary pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3793733
@@ Property / cites work: Q3793733 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Q3815544
@@ Property / cites work: Q3815544 / rank @@
+Normal rank