On inverse deterministic pushdown transductions (Q1245575): Difference between revisions

@@ Property / author @@
+Paul M. B. Vitányi
@@ Property / author: Paul M. B. Vitányi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(78)90028-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2038503876
@@ Property / OpenAlex ID: W2038503876 / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of languages
@@ Property / cites work: The theory of languages / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Abstract families of deterministic languages
@@ Property / cites work: Abstract families of deterministic languages / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition time of context-free languages by on-line Turing machines
+Normal rank
@@ Property / cites work @@
+Deterministic context free languages
@@ Property / cites work: Deterministic context free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way pushdown automata
@@ Property / cites work: Two-way pushdown automata / 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 @@
+Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+A universal context-free grammar
@@ Property / cites work: A universal context-free grammar / rank @@
+Normal rank
@@ Property / cites work @@
+Q5180413
@@ Property / cites work: Q5180413 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+How to Make Arbitrary Grammars Look Like Context-Free Grammars
+Normal rank
@@ Property / cites work @@
+Q4140411
@@ Property / cites work: Q4140411 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank