Decomposition Theorems for Various Kinds of Languages Parallel in Nature
Sven Skyum · SIAM Journal on Computing · 1976
In this paper we give a method for decomposing subclasses of different families of languages, parallel in nature, into other families. These decomposition theorems can be used to produce languages not it a family by using examples of languages not belonging to some “smaller” family.