✦ LIBER ✦

Classes of languages and linear-bounded automata

✍ Scribed by S.-Y. Kuroda

Book ID: 114036460
Publisher: Elsevier Science
Year: 1964
Weight: 859 KB
Volume: 7
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(64)90120-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of universal linear bounded auto

A class of universal linear bounded automata

✍ Eliot D. Feldman; James C. Owings Jr. 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Dm-automata and classes of context-free

Dm-automata and classes of context-free languages

✍ A. B. Stavrovskii; O. Yu. Pavliv 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 520 KB

Faster recognition of languages for boun

Faster recognition of languages for bounded cellular automata

✍ Hiromi Miyajima 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

“Real-time” equivalence of cellular auto

“Real-time” equivalence of cellular automata and linear-bounded automata

✍ David L. Milgram 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 285 KB

On the properties of language classes de

On the properties of language classes defined by bounded reaction automata

✍ Okubo, Fumiya; Kobayashi, Satoshi; Yokomori, Takashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 438 KB

On tape-bounded complexity classes and m

On tape-bounded complexity classes and multihead finite automata

✍ I.H. Sudborough 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 798 KB

The principal result described in this paper is the equivalence of the following statements : (1) Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2) The context-free language Lp (described i