✦ LIBER ✦

Two-way one-counter automata accepting bounded languages

✍ Scribed by Petersen, H.

Book ID: 115461414
Publisher: Association for Computing Machinery
Year: 1994
Weight: 184 KB
Volume: 25
Category: Article
ISSN: 0163-5700
DOI: 10.1145/193820.193835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-way bounded cellular automata

✍ Charles R. Dyer 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 939 KB

One-way weak-stack-counter automata

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

Languages Simultaneously Complete for On

Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata

✍ Hartmanis, J.; Mahaney, S. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1007 KB

Checking automata and one-way stack lang

Checking automata and one-way stack languages

✍ Sheila Greibach 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 837 KB

A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack. The checking automaton languages (cal) form a full AFL closed under substitution. If L C a\* is an infinite cal, then L contains an infinite regular set. Conse

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

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