𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A homomorphic characterization of recursively enumerable languages

✍ Scribed by Sadaki Hirose; Satoshi Okawa; Masaaki Yoneda

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
376 KB
Volume
35
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Homomorphic characterizations of recursi
Homomorphic characterizations of recursively enumerable languages with very small language classes
✍ Satoshi Okawa; Sadaki Hirose πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 137 KB

In this paper, we attempt to characterize the class of recursively enumerable languages with much smaller language classes than that of linear languages. Language classes, (i; j) LL and (i; j)ML, of (i; j) linear languages and (i; j) minimal linear languages are deΓΏned by posing restrictions on the

On a Class of Recursively Enumerable Set
On a Class of Recursively Enumerable Sets
✍ Farzad Didehvar πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 225 KB πŸ‘ 1 views

## Abstract We define a class of so‐called βˆ‘(__n__)‐sets as a natural closure of recursively enumerable sets __W__~n~ under the relation β€œβˆˆβ€ and study its properties.