𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rudimentary relations and stack languages

✍ Scribed by Ytha Y. Yu

Publisher
Springer
Year
1976
Tongue
English
Weight
421 KB
Volume
10
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rudimentary Languages and Second-Order L
Rudimentary Languages and Second-Order Logic
✍ Malika More; FrΓ©dΓ©ric Olive πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 446 KB

## Abstract The aim of this paper is to point out the equivalence between three notions respectively issued from recursion theory, computational complexity and finite model theory. One the one hand, the rudimentary languages are known to be characterized by the linear hierarchy. On the other hand,

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