Abstract
Union, homomorphic and inverse homomorphic representations of languages are obtained, starting from reduced languages introduced in earlier formal language approaches to parallel program schemes. The reduced-ness decidability is also investigated (it is decidable for regular and undecidable for linear languages).
Get full access to this article
View all access options for this article.