𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A shrinking lemma for indexed languages

✍ Scribed by Robert H. Gilman

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
350 KB
Volume
163
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Pumping lemmas for term languages
Pumping lemmas for term languages
✍ T.S.E. Maibaum πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 664 KB
Index sets for Ο‰-languages
Index sets for Ο‰-languages
✍ Douglas Czenzer; Jeffrey B. Remmel πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 223 KB

## Abstract An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of au