✦ LIBER ✦

Remarks on two-way automata with weak-counters

✍ Scribed by Satoru Miyano

Book ID: 113162663
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 263 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90032-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-way weak-stack-counter automata

✍ Satoru Miyano 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 994 KB

On two-way weak counter machines

✍ Tat-hung Chan 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 771 KB

Two-way one-counter automata accepting b

Two-way one-counter automata accepting bounded languages

✍ Petersen, H. 📂 Article 📅 1994 🏛 Association for Computing Machinery ⚖ 184 KB

On two-way multihead automata

✍ Oscar H. Ibarra 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 479 KB

For each positive integer n, let -~eN(n ) be the class of sets accepted by a family of automata of type N, each with a read-only input with endmarkers and n two-way input heads. The following result, which is applicable to most types of two-way multihead devices, is proved: If for each positive inte

On two-way tree automata

✍ Etsuro Moriya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB

The Reduction of Two-Way Automata to One

The Reduction of Two-Way Automata to One-Way Automata

✍ Shepherdson, J. C. 📂 Article 📅 1959 🏛 IBM 🌐 English ⚖ 291 KB