Abstract

We have introduced a new operation called the superimposition operation. The translucent language generated by a given superimposition operation and a language L is the set of words generated by the superimposition of any two words in L. In this paper we study the properties of translucent languages. We also introduce a variant of the operation called Superimposition under control. We examine the properties of languages under this operation