Decomposition Theorems for Various Kinds of Languages Parallel in Nature

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Department of Computer Science
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 languageEnglish
JournalS I A M Journal on Computing
Volume5
Issue3
Pages (from-to)284-296
Number of pages13
ISSN0097-5397
DOIs
Publication statusPublished - 1976

See relations at Aarhus University Citationformats

ID: 37176270