The concept of transitive closure is useful for the conversion of classical finite automata into regular expressions. In this paper, we generalize and extend the concept of transitive closure for the conversion of fuzzy automata into fuzzy regular expressions. We prove that, for a fuzzy automaton M where r is a fuzzy regular expression obtained using the proposed approach, L(M)=L(r). Finally, a numerical example illustrates this conversion.
HussainA. and ShabbirM., Soft finite state machine, Journal of Intelligent and Fuzzy System (2015). DOI: 10.3233/IFS-151642.
2.
KumarA. and VermaA.K., A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata, Maejo International Journal of Science and Technology7(3) (2013), 396–407.
3.
StamenkovićA. and ĆirićM., Construction of fuzzy automata from fuzzy regular expressions, Fuzzy Sets and Systems199 (2012), 1–27.
4.
Cao and EzawaNondeterministic fuzzy automata, Information Sciences191 (2012), 86–97.
DuD. and KoK., Problem Solving in Automata, Languages, and Complexity, John Wiley & Sons, New York, NY,
2001.
7.
QiuD., Supervisory control of fuzzy discrete event systems: A formal approach, IEEE Transactions on Systems, Man and Cybernetics-Part B35(1) (2005), 72–88.
8.
QiuD. and WangH., A probabilistic model of computing with words, Journal of Computer and System Sciences70(2) (2005), 176–200.
9.
SantosE.S., Maxmin automata, Information and Control13 (1968), 363–377.
10.
LinF. and YingH., Modeling and control of fuzzy discrete even systems, IEEE Transactions on Systems, Man and Cybernetics, Part B32(4) (2002), 408–415.
11.
NejadH.C., AzadbakhtB., AdenihvandK., MohammadiM. and MirzamohammadM., Fuzzy cellular learning automata for lesion detection in retina images, Journal of Intelligent and Fuzzy System27(5) (2014), 2297–2303.
12.
WangH. and QiuD., Computing with words via Turing machines: A Formal Approach, IEEE Transactions on Fuzzy Systems11(6) (2003), 742–753.
13.
BrzozowskiJ.A., Derivatives of regular expressions, Journal of the ACM11(4) (1964), 481–494.
14.
HopcroftJ.E. and UllmanJ.D., Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, Reading, MA,
1979.
15.
MordesonJ.N. and MalikD.S., Fuzzy Automata and Languages: Theory and Applications, Chapman & Hall/ CRC, Boca Raton, London, 2002.
16.
MendivilJ.R.G.D. and GaritagoitiaJ.R., A Comment on “Construction of fuzzy automata from fuzzy regular expressions”, Fuzzy Sets and Systems262 (2015), 102–110.
17.
SinghK., Conversion of deterministic finite automata to regular expression using bridge state, Thapar University, M.E. Thesis, 2011.
18.
ZadehL.A., Fuzzy languages and their relation to human and machine intelligence, Proceeding International Conference on Man and Computer, S Karger, Basel, 1971, pp. 130–165
.
19.
ZadehL.A., Fuzzy sets, Information Control8 (1965), 338–353.
20.
IlieL. and YuS., Follow automata, Information and Computation186(1) (2003), 140–162.
21.
DrosteM. and GastinP., Weighted automata and weighted logics, Theoretical Computer Science380 (2007), 69–86.
22.
YingM.S., A formal model of computing with words, IEEE Transactions on Fuzzy Systems10(5) (2002), 640–652.
23.
KumarR., Conversion of fuzzy regular expressions to fuzzy automata using the Follow automata, M.E. Thesis, Thapar University, 2014.
24.
KumarR. and KumarA., Metamorphosis of fuzzy regular expressions to fuzzy automata using the follow automata, arXiv preprint arXiv:411.2865, 2014.
25.
ChhabraT. and KumarA., Review Paper on Conversion of Deterministic Finite Automata to Regular Expressions, International Conference On Engineering Innovation and Technology, Nagpur, 2012, pp. 21–24.
26.
StańczykU., Decision rule length as a basis for evaluation of attribute relevance, Journal of Intelligent & Fuzzy Systems24(3) (2013), 429–445.
27.
WeeW.G. and FuK.S., A formulation of fuzzy automata and its application as a model of learning systems, IEEE Transactions on Systems Man and Cybernetics5(3) (1969), 215–223.
28.
LiY., A categorical approach to lattice-valued fuzzy automata, Fuzzy Sets and Systems157 (2006), 855–864.
29.
LiY., Finite automata theory with membership values in lattices, Information Sciences181(5) (2011), 1003–1017.
30.
LiY. and PedryczW., Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids, Fuzzy Sets and System156(1) (2005), 68–92.
