Some modifications of auxiliary pushdown automata (Q3485868): Difference between revisions

@@ Property / author @@
+Frank Drewes
@@ Property / author: Frank Drewes / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1940436525
@@ Property / OpenAlex ID: W1940436525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131653
@@ Property / cites work: Q4131653 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4107932
@@ Property / cites work: Q4107932 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Q4055193
@@ Property / cites work: Q4055193 / rank @@
+Normal rank
@@ Property / cites work @@
+Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
+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 @@
+Classes of languages and linear-bounded automata
@@ Property / cites work: Classes of languages and linear-bounded automata / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Q3707407
@@ Property / cites work: Q3707407 / rank @@
+Normal rank