Abstract
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.
Original language | English |
---|---|
Journal | S I A M Journal on Computing |
Volume | 5 |
Issue | 3 |
Pages (from-to) | 284-296 |
Number of pages | 13 |
ISSN | 0097-5397 |
DOIs | |
Publication status | Published - 1976 |