ICTACT Journal on Soft Computing

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Generation of Translucent Language by Superimposition Operation


Affiliations
1 Department of Mathematics, Madras Christian College, India
     

   Subscribe/Renew Journal


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.
Subscription Login to verify subscription
User
Notifications
Font Size

  • Ahmad Kadrie, V. Rajkumar Dare, D.G. Thomas and K.G. Subramanian, “Algebraic Properties of the Shuffle Over ωTrajectories”, Information Processing Letters, Vol. 80, No.3, pp. 139-144, 2001.

  • C. Annal Deva Priya Darshini and V. Rajkumar Dare, “Superimposition Operations on Words”, Proceedings of National Conference on Mathematics and Computer Applications, pp. 48-52, 2015.

  • Christian Choffrut and Juhani Karhumaki, “Combinatorics of words in Handbook of Formal Languages”, Vol. 1, Handbook of Formal Languages, Springer, pp. 329-438, 1997.

  • Christian Choffrut and Berke Durak, “Collage of TwoDimensional Words”,Theoretical Computer Science, Vol.340, No. 2, pp. 364-380, 2005.

  • J.E. Hopcroft and J.D. Ullman, “Introduction to Automata Theory, Languages and Computation”, Narosa Publishing House, 1979.

  • Masami Ito, Lila Kari and Gabriel Thierrin, “Shuffle and Scattered Deletion Closure of Languages”, Theoretical Computer Science, Vol. 245, No. 1, pp. 115-133, 2000.

  • Jean Berstel and Dominique Perrin, “The Origins of Combinatorics of Words”, European Journal of Combinatorics, Vol. 28, No. 3, pp. 996-1022, 2007.

  • A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Theoretical Computer Science, Vol. 197, No. 1-2, pp. 1-56,1998.

  • J.E. Tremblay and R. Manohar, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw Hill, 1997.


Abstract Views: 213

PDF Views: 2




  • Generation of Translucent Language by Superimposition Operation

Abstract Views: 213  |  PDF Views: 2

Authors

C. Annal Deva Priya Darshini
Department of Mathematics, Madras Christian College, India

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.

References