✦ LIBER ✦

Reversal-bounded multicounter Σ-machines

✍ Scribed by L. P. Lisovik

Publisher: Springer US
Year: 1989
Tongue: English
Weight: 599 KB
Volume: 24
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01132080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reversal-bounded multipushdown machines

✍ Brenda S. Baker; Ronald V. Book 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown s

On reversal bounded alternating Turing m

On reversal bounded alternating Turing machines

✍ Maciej Liśkiewicz; Krzysztof Loryś; Marek Piotrów 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 918 KB

Tape-reversal bounded turing machine com

Tape-reversal bounded turing machine computations

✍ J. Hartmanis 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 667 KB

This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are inves

A characterization of reversal-bounded m

A characterization of reversal-bounded multipushdown machine languages

✍ W. Rytter; M. Chrobak 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 266 KB