Homomorphic characterizations of recursi
✍
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