# Some Algebraic Structures of Languages

Volume 14, Issue 3, pp 250-257 Publication Date: April 28, 2015
• 709 Downloads
• 828 Views

### Authors

Dasharath Singh - Mathematics Department, Ahmadu Bello University, Zaria, Nigeria. Ahmed Ibrahim Isah - Mathematics Department, Ahmadu Bello University, Zaria, Nigeria.

### Abstract

In this paper, suitable operations are defined on the class of partitions of a language which give rise to certain monoids and semigroups. In particular, certain algebraic structures of a language defined over a string are described.

• Language
• partition
• semigroup
• monoid

•  11P83
•  68Q45
•  68Q70

### References

• [1] B. Ahmadi, C. M. Campbell, H. Doostie, Non-commutative finite monoids of a given order $𝑛\geq 4$ , VERSITA, 22 (2) (2014), 29-35.

• [2] J. Gallier, Introduction to the Theory of Computation, Formal Languages and Automata Models of Computation, Lecture Notes, (2010), 1- 60.

• [3] E. Hosseinpour, T-Rough Fuzzy Subgroups of Groups, The Journal of Mathematics and Computer Science, 12 (3) (2014), 186-195.

• [4] J. Kari, Automata and Formal Languages, Lecture Notes, University of Turku, Finland, (2013), 1 – 150.

• [5] D. E. Knuth, The Art of Computer Programming, Semi-numerical Algorithms, Vol. II, 2nd, Addison-Wesley (1981)

• [6] U. Priss, L. J. Old, Conceptual Structures: Inspiration and Application, Proceedings of the 14th International Conference on Conceptual Structures ICCS, Denmark, 4068 (2006), 388-400.

• [7] J. P. Tremblay, R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw-Hill Edition, (1997)

• [8] S. A. N. Zadeh, A. Radfar, A. B. Saied, On BP-algebras and QS-algebras, The Journal of Mathematics and Computer Science, 5 (1) (2012), 17-21.