Title
Representation Theorems Using Dos Languages
Abstract
It is demonstrated that every context-free language is a homomorphic image of the intersection of two DOS languages and that every recursively enumerable language is the homomorphic image of the intersection of three DOS languages. It is also proved that by increasing the number of components in the intersections of DOS languages one gets an infinite hierarchy of classes of languages within the class of context-sensitive languages.
Year
DOI
Venue
1982
10.1016/0304-3975(82)90089-5
THEORETICAL COMPUTER SCIENCE
DocType
Volume
Issue
Journal
21
1
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
A. Ehrenfeucht11823497.83
G. Rozenberg229864.16