GENERATION OF TRANSLUCENT LANGUAGE BY SUPERIMPOSITION OPERATION

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

Authors
C Annal Deva Priya Darshini, V Rajkumar Dare
Madras Christian College, India

Keywords
Translucent Words, Translucent Languages, Superimposition Under Control
Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 7 , Issue: 4 )
Date of Publication :
July 2017

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.