SYNTACTIC FUZZY MONOIDS
Keywords:
fuzzy sets, recognizability, monoidAbstract
Fuzzy monoids and fuzzy congruences are introduced and the syntactic fuzzy monoid ML associated to a subset L of a fuzzy monoid M is constructed. It is shown that ML is minimal among all fuzzy epimorphisms h : M \(\longrightarrow\) M′ whose kernel saturates L. The subset L is said to be fuzzy recognizable whenever ML is finite. The so obtained class is closed under boolean operations and inverse morphisms.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Antonios Kalampakas, Olympia Louscou-Bozapalidou

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

