𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Checking automata and one-way stack lang
✍ 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