✦ LIBER ✦

On linear context-free languages and one-way multihead automata

✍ Scribed by Wojciech Rytter

Book ID: 113162688
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 321 KB
Volume: 19
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90077-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on multihead automata and context

A note on multihead automata and context-sensitive languages

✍ Walter J. Savitch 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 204 KB

Remarks on string-matching and one-way m

Remarks on string-matching and one-way multihead automata

✍ Marek Chrobak; Wojciech Rytter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Remarks on sorting and one-way multihead

Remarks on sorting and one-way multihead finite automata

✍ Mirosław KutyŁowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Time complexity of languages recognized

Time complexity of languages recognized by one-way multihead pushdown automata

✍ Wojciech Rytter 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 374 KB

On context-free languages and push-down

On context-free languages and push-down automata

✍ M.P. Schützenberger 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 943 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