研究max-Lukasiewicz复合推理下的模糊图灵机。形式化定义了模糊图灵机——确定型模糊图灵机、非确定型模糊图灵机、带部分转移函数的非确定型模糊图灵机和多带模糊图灵机,研究了这几类模糊图灵机的关系。进而定义模糊图灵机上的模糊递归可枚举语言和模糊递归语言。得出结论:当接受模糊递归可枚举语言时,非确定型模糊图灵机和确定型模糊图灵机不等价;而接受模糊递归语言时,它们等价。
In this paper we study fuzzy Turing machines based on max-Lukasiewicz composition inference.We give several formulations of fuzzy Turing machines which correspond to deterministic fuzzy Turing machines, nondeterministic fuzzy Turing machines,nondeterministic fuzzy Turing machines with crisp transition functions and multi-tape fuzzy Turing machines,and the relationship between them are also discussed.Furthermore,the notions of fuzzy recursively enumerable languages and fuzzy recursive languages are defined in terms of fuzzy Turing machines;then it is showed that nondeterministic fuzzy Turing machines and deterministic fuzzy Turing machines are not equivalent when they accept fuzzy recursively enumerable languages;but they are equivalent when they accept fuzzy recursive languages.