Maximal product of two L-graph automata and some applications

Document Type : Research Paper


Department of Mathematics, Kerman Graduate University of Advanced Technology, Kerman, Iran


The current study aimed to describe the notion of the L-graph, which is constructed on a residuated lattice, presenting the idea of the maximal product of two L-graphs.
    Moreover, the applied algorithm demonstrated its efficiency to a great extent to improve the educational system.
    The results showed that the maximal product of both G and H and reversely, H
    and  G are isomorphic L-graphs.
    The maximal product of two L-graph automata was represented as a new notion,
    followed by investigating their self-sufficiency conditions in two different modes.
    In addition,  A(Z(G))\star~A(Z(H)) and A(Z(H))\star~A(Z(G))  were proved as two isomorphic-related L-graph automata considering the residuated lattice properties.
    Then, correlations among A(Z(G))\star A(Z(H)),  A(Z(G)),  and A(Z(H)) behaviors were explained.
    As a result, some theorems of the relationship between L-graph automata and their maximal product were introduced.
    Subsequently, some related theorems were proved, and several examples were provided to illustrate these new notions. Further, an application of the maximal product of two related L-graph automata was expressed in the factors affecting the spared of the coronavirus,  and accordingly,
    some solutions were suggested to reduce the spread of the virus.


[1] Kh. Abolpour, M. Shamsizadeh, M. M. Zahedi, Admissible partition for BL-general fuzzy automaton, Iranian Journal of Fuzzy Systems, 15 (2018), 79-90.
[2] Kh. Abolpour, M. M. Zahedi, General fuzzy automata based on complete residuated lattice-valued, Iranian Journal of Fuzzy Systems, 14 (2017), 103-121.
[3] K. Abolpour, M. M. Zahedi, M. Shamsizadeh, BL-general fuzzy automata and minimal realization: Based on the associated categories, Iranian Journal of Fuzzy Systems, 17 (2020), 155-169.
[4] AIM minimum rank-special graphs work group (F. Barioli, W. Barrett, S. Butler, S. M. Cioaba, D. Cvetkovic, S. M. Fallat, C. Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I. Sciriha, W. So, D. Stevanovic, H. van der Holst, K. Vander Meulen, A. Wangsness), Zero forcing sets and the minimum rank of graphs, Linear Algebra and Its Applications, 428 (2008), 1628-1648.
[5] A. Arenas, A. Diaz-Guilera, J. Kurths, Y. Moreno, C. Zhou, Synchronization in complex networks, Physics Reports, 469 (2008), 93-153.
[6] A. Barrat, M. Barthélemy, A. Vespignani, Dynamical processes in complex networks, Cambridge University Press, New York, NY, USA, 2008.
[7] J. C. Bezdek, J. D. Harris, Fuzzy partitions and relations: An axiomatic basis for clustering, Fuzzy Sets and Systems, 1 (1978), 111-127.
[8] N. L. Biggs, E. K. Lioyd, R. J. Wilson, Graph theory 1736-1936, Oxford University Press, 1986.
[9] K. Blount, C. Tsinakis, The structure of residuated lattices, International Journal of Algebra and Computation, 13 (2003), 437-461.
[10] J. A. Bondy, U. S. R. Murty, Graph theory, Springer-Verlag, Uk, London, 2008.
[11] M. Golmohamadian, M. M. Zahedi, N. Soltankhah, Some algebraic hyper structures related to zero forcing sets and forcing digraphs, Journal of Algebra and Its Applications, 18 (2019), 1950192.
[12] J. M. Howie, Automata and languages, Clarendon Press, New York, 1991.
[13] D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, Theory of Computing, 11 (2015), 105-147.
[14] V. B. Kuzmin, Building group decisions in spaces of strict and fuzzy binary relations, Nauka, Moscow, 1982.
[15] J. N. Mordeson, D. S. Malik, Fuzzy automata and languages theory and applications, CRC Press, New York, 2002.
[16] J. N. Mordeson, S. Msthew, D. S. Malik, Fuzzy graph theory, Springer, Cham, 2018.
[17] J. N. Mordeson, P. S. Nair, Fuzzy graph and fuzzy hypergraph, Springerp-Varlag, Berlin, Heidelberg, 2000.
[18] D. Qiu, Automata theory based on complete residuated lattice-valued logic(I), Science in China Series (F), 44 (2001), 419-429.
[19] D. Qiu, Automata theory based on complete residuated lattice-valued logic(II), Science in China Series (F), 45 (2002), 442-452.
[20] E. Raisi Sarbizhan, M. M. Zahedi, M. Shamsizade, L-graph automata and some applications, The Computer Journal, (2022),
[21] E. S. Santos, Maxmin automata, Information Control, 13 (1968), 363-377.
[22] M. Shamsizadeh, M. M. Zahedi, Minimal and statewise minimal intuitionistic general L-fuzzy automata, Iranian Journal of Fuzzy Systems, 13 (2016), 131-152.
[23] M. Shamsizadeh, M. M. Zahedi, K. Abolpour, Bisimulation for BL-general fuzzy automata, Iranian Journal of Fuzzy Systems, 13 (2016), 35-50.
[24] S. P. Tiwari, S. Sharan, Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects, International Journal of Fuzzy and Information Engineering, 4 (2012), 155-164.
[25] M. Ward, R. P. Dilworth, Residuated lattices, Transactions of the American Society, 45 (1939), 335-354.
[26] W. G. Wee, On generalization of adaptive algorithm and application of the fuzzy sets conceptto pattern classification, Ph.D. Thesis, Purdue University, Lafayette, IN, 1967.
[27] D. B. West, Introduction to graph theory, (Vol. 2), Upper Saddle River, N. J, 2001.
[28] L. A. Zadeh, Similarity relations and fuzzy orderings, Information Sciences, 3 (1971), 177-200.