Abstract
There are several variations of fuzzy Turing machines in the literature, many of them require a t-norm in order to establish their accepted language. This paper generalize the concept of non-deterministic fuzzy Turing machine - NTFM, replacing the t-norm operator for several aggregation functions. We establish the languages accepted by these machines, called fuzzy recursively enumerable languages or simply LFRE and show, among other results, which classes of LFRE are closed under unions and intersections.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
