An algebraic study of LB-valued general fuzzy automata: On the concept of the layers

Document Type : Original Article

Authors

1 Department of Math.,Faculty Member, Islamic Azad University,Shiraz,Iran

2 Behbahan Khatam Alanbia University of Technology, Khouzestan, Iran

Abstract

The present study aims at introducing a new concept of layer of LB-valued general fuzzy automata (LB-valued GFA)  where B is regarded as a set of propositions about the GFA, in which its underlying structure has been a lattice-ordered  monoid. In general, it demonstrates that the layer plays a key role in the algebraic study of LB-valued GFA by  characterizing the concepts of subautomata and separated subautomata of an LB-valued GFA in terms of its layers. In  other words, it highlights that every LB-valued general fuzzy automaton has at least one strongly connected  subautomaton. In specific, the characterization of some algebraic concepts such as subautomaton, retrievability and  connectivity of an LB-valued GFA in terms of its layers is provided. In addition, it is shown that the maximal layer of a  cyclic LB-valued general fuzzy automaton and minimal layer of a directable LB-valued general fuzzy automaton are  unique. Finally, we investigate the different poset structures associated with an LB-valued general fuzzy automaton,  demonstrating some of these posets as finite upper semilattice, and introducing the isotone Galois connections between  some of the pairs of the posets/finite upper semilattices introduced. 

Keywords

References

[1] Kh. Abolpour, Topological structures induced by general fuzzy automata based on lattice ordered monoid, Mathematical Researchers, 7(2) (2021), 177–190. DOI:10.52547/mmr.7.2.177.
[2] Kh. Abolpour, M.M. Zahedi, L B-valued general fuzzy automata, Fuzzy Sets and Systems, 442 (2022), 288–308. DOI:10.1016/j.fss.2021.08.017.
[3] K. Abolpour, M.M. Zahedi, M. Shamsizadeh, New directions in general fuzzy automata: A dynamic-logical view, AUT Journal of Mathematics and Computing, 1(2) (2020), 251–262. DOI:10.22060/AJMC.
2020.18629.1040.
[4] S.E. Atani, M.S.S. Bazari, Lattice structures of automata, Communications Faculty of Sciences University of Ankara-Series A1 Mathematics and Statistics, 69 (2020), 139–151. DOI:10.31801/cfsuasmas.
675691.
[5] Z. Bavel, Structure and transition preserving functions of finite automata, Journal of the Association for Computing Machinery, 15 (1968), 135–158.
[6] R. Belohalávek, Fuzzy Galois connections, Mathematical Logic Quarterly, 45 (1999), 497–504. DOI:10.
1002/malq.19990450408.
[7] R. Belohalávek, J. Konecny, Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited, Information Sciences, 199 (2012), 133–137. DOI:10.1016/
j.ins.2012.02.064.
[8] G. Birkhoff, Lattice theory, American Mathematical Society, Providence, RI. 3rd Edn. 1967.
[9] M.E. Cornejo, D. Lobo, J. Medina, Syntax and semantics of multi-adjoint normal logic programming, Fuzzy Sets and Systems, 345 (2018), 41–62. DOI:10.1016/j.fss.2017.12.009.
[10] K. Denecke, M. Erné, S.L. Wismath, Galois connections and applications, Kluwer Academic Publishers, Dordrecht, S.L. (Eds), 2004. DOI:10.1007/978-1-4020-1898-5.
[11] M. Doostfatemeh, S.C. Kremer, New directions in fuzzy automata, International Journal of Approximate Reasoning, 38 (2005), 175–214. DOI:10.1016/j.ijar.2004.08.001.
[12] B. Ganter, R. Wille, Formal concept analysis: Mathematical foundations, Springer, Heidelberg, 1999. DOI:10.1007/978-3-642-59830-2.
[13] F. Garcìa-Pardo, I.P. Cabrera, P. Cordero, M. Ojeda-Aciego, On Galois connections and soft computing, In: Rojas I., Joya G., Cabestany J. (eds) Advances in Computational Intelligence, IWANN 2013. Lecture Notes in Computer Science, 7903 (2013), Springer, Berlin, Heidelberg, DOI: 10.1007/978-3-642-38682-4 26.
[14] J.G. Garcìa, I. Mardones-Perez, M.A.P. Vicente, D. Zhang, Fuzzy Galois connections categorically, Mathematical Logic Quarterly, 56 (2010), 131–147. DOI:10.1002/malq.200810044.
[15] H. Herrlich, M. Husek, Galois connections categorically, Journal of Pure and Applied Algebra, 68 (1990), 165–180. DOI:10.1016/0022-4049(90)90141-4.
[16] W.M.L. Holcombe, Algebraic automata theory, Cambridge University Press, Cambridge 1982.
[17] M. Ito, Algebraic structures of automata, Theoretical Computer Science, 429 (2012), 164–168. DOI:10.1016/j.tcs.2011.12.035.
[18] M. Ito, J. Duske, On cofinal and definite automata, Acta Cybern, 6 (1983), 181–189. [19] J. Jārvinen, Pawlak’s information systems in terms of Galois connections and functional dependencies, Fundamenta Informaticae, 75 (2007), 315–330.
[19] J. Jin, Q. Li, Y. Li, Algebraic properties of L-fuzzy finite automata, Information Sciences, 234 (2013), 182–202. DOI:10.1016/j.ins.2013.01.018.
[20] S. Kerkhoff, A general Galois theory for operations and relations in arbitrary categories, Algebra Universalis, 68 (2012), 325–352. DOI: 10.1007/s00012-012-0209-9.
[21] Y. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids, Fuzzy Sets and Systems, 156 (2005), 68–92. DOI:10.1016/j.fss.2005.04.004.
[22] D.S. Malik, J.N. Mordeson, M.K. Sen, Submachines of fuzzy finite state machine, The Journal of Fuzzy Mathematics, 2 (1994), 781–792.
[23] J.N. Mordeson, D.S. Malik, Fuzzy automata and languages: Theory and applications, Chapman and Hall/CRC, London/Boca Raton 2002. DOI:10.1201/9781420035643.
[24] O. Ore, Galois connexions, Transactions of the AMS-American, Mathematical Society, 55 (1994), 493–513.
[25] Z. Pawlak, Rough sets, International Journal of Computer and Information Science, 11 (1982), 341–356.
[26] I. Perfilieva, A.P. Singh, S.P. Tiwari, On the relationship among f-transform, fuzzy rough set and fuzzy topology, Soft Computing, 21 (2017), 3513–3523. DOI:10.1007/s00500-017-2559-x.
[27] D.W. Qiu, Supervisory control of fuzzy discrete event systems: A formal approach, IEEE Transactions on Systems, Man and Cybernetics-Part B, 35 (2005), 72–88. DOI:10.1109/TSMCB.2004.840457.
[28] S. Roman, Lattices and ordered sets, Springer, New York, 2008. DOI:10.1007/978-0-387-78901- 9.
[29] E.S. Santos, Maximin automata, Information and Control, 12 (1968), 367–377. DOI:10.1016/ S0019-9958(68)90864-4.
[30] S.P. Tiwari, A.K. Singh, S. Sharan, Fuzzy automata based on lattice-ordered monoid and associated topology, Journal of Uncertain Systems, 6 (2012), 51–55. DOI:10.1007/s12543-012- 0108-y.
[31] S.P. Tiwari, V.K. Yadav, A.K. Singh, On algebraic study of fuzzy automata, International Journal of Machine Learning and Cybernetics, 6 (2014), 479–485. DOI:10.1007/s13042-014- 0233-5.
[32] S. Vickers, Topology via logic, Cambridge University Press, Cambridge, 1989.
[33] W.G. Wee, K. S. Fu, A formulation of fuzzy automata and its application as a model of learning systems, IEEE Transactions on Systems Science and Cybernetics, 5 (1969), 215–223. DOI:10.1109/TSSC.1969.300263.
[34] R. Wille, Formal concept analysis as mathematical theory of concepts and concept hierarchies, in B. Ganter et al., (Eds), Formal Concept Analysis, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 3626 (2005), 1–33. DOI:10.1007/11528784 1.
[35] V.K. Yadav, S. Yadav, M.K. Dubey, S.P. Tiwari, Algebraic characterization of IF[1]automata, Progress in Advanced Computing and Intelligent Engineering, (2019) 565–575. DOI:10.1007/978-981-13-0224-4 51.
[36] L.A. Zadeh, Fuzzy sets, Information and Control, 8 (1965), 338–353. DOI:10.1016/S0019-9958(65)
90241-X.
Journal of Algebraic Hyperstructures and Logical Algebras
Volume 4, Issue 2
November 2023
Pages 107-121

Files

Share

How to cite

Statistics