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.
BedregalB.C., and AciólyB.M., A computability on the interval space: A domain approach, in: Proc XXIII Conf Latinoamericana de Informática, vol I, Valparaíso-Chile, 1997, pp. 107–116.
2.
BedregalB.C., and FigueiraS., On the computing power of fuzzy Turing machines, Fuzzy Sets and Systems159 (2008), 1072–1083.
3.
BeliakovG., PraderaA., and CalvoT., Aggregation functions: A guide for practitioners, Stud Fuzziness Soft Comput221 (2007), 4.
4.
BlumL., ShubM., and SmaleS., On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull Amer Math Soc21(1) (1989), 1–46.
5.
BiacinoL., and GerlaG., Fuzzy subsets: A constructive approach, Fuzzy Sets and Systems45 (1992), 161–168.
6.
BiacinoL., and GerlaG., Fuzzy logic, continuity and effectiveness, Arch Math Logic41 (2002), 643–667.
7.
BustinceH., BarrenecheaE., PagolaM., FernandezJ., BedregalB., MonteroJ., HagrasH., HerreraF., and De BaetsB., A historical account of types of fuzzy sets and their relationships, IEEE Transactions on Fuzzy Systems24(1) (2016), 179–194.
8.
ClaresB., and DelgadoM., Introduction of the concept of recursiveness of fuzzy functions, Fuzzy Sets and Systems21 (1987), 301–310.
9.
CostaA.C.R., and DimuroG.P., Interactive computation: Stepping stone in the pathway from classical to developmental computation, Electronic Notes in Theoretical Computer Science141(5) (2005), 5–31.
10.
DeutschD., Quantum theory, the Church-Turing principle and the universal quantum computer, Proc Roy Soc London Ser400 (1985), 97–117.
MoragaC., Towards a fuzzy computability, Mathware & Soft Comput6 (1999), 163–172.
25.
Morales-BuenoR., ConejoR., Pérez de-la CruzJ.L., and Triguero-RuizF., On a class of fuzzy computable functions, Fuzzy Sets and Systems121 (2001), 505–522.
26.
MordersonJ.N., and MalikD.S., Fuzzy Automata and Languages: Theory and Applications, Chapman & Hall, CRC, London, Boca Raton, FL, 2002.
