𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stack versus sensitivity for one-way automata

✍ Scribed by Mirosław Kutyłowski

Book ID
107948754
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
831 KB
Volume
119
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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