✦ LIBER ✦

On the Concatenation of One–Turn Pushdowns

✍ Scribed by Christian Wartena

Book ID: 110283171
Publisher: Springer
Year: 1999
Tongue: English
Weight: 83 KB
Volume: 2
Category: Article
ISSN: 1572-848X
DOI: 10.1023/a:1009924903938

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On The Space Complexity Of Turn Bounded

On The Space Complexity Of Turn Bounded Pushdown Automata

✍ Moriya, Etsuro; Tada, Takemaru 📂 Article 📅 2003 🏛 Taylor and Francis Group 🌐 English ⚖ 183 KB

On reversal-bounded counter machines and

On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store

✍ Pavol Duris; Zvi Galil 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 482 KB

On the power of deep pushdown stacks

✍ Argimiro Arratia Quesada; Iain A. Stewart 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 320 KB

On the computational power of pushdown a

On the computational power of pushdown automata

✍ A.V. Aho; J.D. Ullman; J.E. Hopcroft 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 361 KB

We present a relation between the sets accepted by two-way pushdown automata and certain tape complexity classes of off-line Turing machines. Specifically, let L be a language accepted by a nondeterministic off-line Turing machine T. Let T have a t-symbol storage-tape alphabet. If for all but a fini

An improvement on valiant's decision pro

An improvement on valiant's decision procedure for equivalence of deterministic finite turn pushdown machines

✍ C. Beeri 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 834 KB

On a characterization of pushdown permut

On a characterization of pushdown permuters

✍ R.K. Shyamasundar 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 880 KB