𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of the class of enumerable languages

✍ Scribed by K. K. Pivnitskaya

Publisher
SP MAIK Nauka/Interperiodica
Year
1992
Tongue
English
Weight
482 KB
Volume
51
Category
Article
ISSN
0001-4346

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

A characterization of the leaf language
A characterization of the leaf language classes
✍ Bernd Borchert; Riccardo Silvestri πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 602 KB

Bovet, Crescenzi, and Silvestri ( 1992 , 1995 ), and independently Vereshchagin ( 1994) , showed that many complexity classes in the polynomial time setting are leaf language classes, i.e. classes which are determined by two disjoint languages. They gave many examples but they did not characteriz

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.