On Algebraic Properties of Inverse Fuzzy Languages
Aims/Objectives: In this paper, we investigate some of the algebraic properties of inverse fuzzy languages. We proved that a fuzzy automaton is inverse if and only if the transition monoid is an inverse monoid. A fuzzy language is an inverse fuzzy language if the minimal fuzzy automaton recognizing that fuzzy language is an inverse fuzzy automaton. We also discuss some more properties of an inverse fuzzy language based on the fact that an inverse monoid is one which is regular and idempotent commute.
2019 ◽
Vol 15
(02)
◽
pp. 361-372
2018 ◽
Vol 14
(03)
◽
pp. 423-444
◽
2021 ◽
2017 ◽
2020 ◽
Vol 9
(10)
◽
pp. 8869-8881
Keyword(s):
Keyword(s):