Abstract
Here we study variety of monoid and semiring recognizable l-fuzzy languages. A l-fuzzy language over an alphabet A is called commutative l-fuzzy language if it satisfies the condition (puvq) = (pvuq) , for all u,v,p,q ∈ A∗. We prove that the set of all commutative l-fuzzy languages is ∗-variety and conjunctive variety of l-fuzzy languages.
Cite
CITATION STYLE
APA
Kumari K, Dr. A. (2020). Commutative l-fuzzy languages. International Journal of Recent Technology and Engineering (IJRTE), 9(1), 1569–1571. https://doi.org/10.35940/ijrte.a2417.059120
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free