Loading…
GENERATION OF TRANSLUCENT LANGUAGE BY SUPERIMPOSITION OPERATION
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...
Saved in:
Published in: | ICTACT journal on soft computing 2017-07, Vol.7 (4), p.1492-1497 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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 |
---|---|
ISSN: | 0976-6561 2229-6956 |
DOI: | 10.21917/ijsc.2017.0207 |