✦ LIBER ✦

On two-way weak counter machines

✍ Scribed by Tat-hung Chan

Book ID: 105278444
Publisher: Springer
Year: 1987
Tongue: English
Weight: 771 KB
Volume: 20
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01692057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Remarks on two-way automata with weak-co

Remarks on two-way automata with weak-counters

✍ Satoru Miyano 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Two-Way Counter Machines and Diophantine

Two-Way Counter Machines and Diophantine Equations

✍ Gurari, Eitan M.; Ibarra, Oscar H. 📂 Article 📅 1982 🏛 Association for Computing Machinery 🌐 English ⚖ 548 KB

Two-Way Counter Machines and Diophantine

Two-Way Counter Machines and Diophantine Equations

✍ Gurari, Eitan M.; Ibarra, Oscar H. 📂 Article 📅 1982 🏛 Association for Computing Machinery 🌐 English ⚖ 548 KB

Let Q be the class of determmistlc two-way l-counter machines accepting only bounded languages Each machine m Q has the property that m every accepting computation, the counter makes at most a fixed number of reversals It is shown that the emptiness problem for Q is decidable. When the counter is un

One-way weak-stack-counter automata

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

On three-way two-dimensional turing mach

On three-way two-dimensional turing machines

✍ Andrzej Szepietowski 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 726 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