Abstract:
The paper is concerned with a generalization of a language of parallel compositions (LPC) [1] where the coordinates of $n$-tuples over whose alphabet a description in LPC is constructed can be regular sets over alphabets of components rather than single letters.