Idioma:

Fuzzy and Intuitionistic Fuzzy Turing Machines

Moniri, Morteza

Fundamenta informaticae, 2013, Vol.123 (3), p.305-315 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Fuzzy and Intuitionistic Fuzzy Turing Machines
Autor: Moniri, Morteza
Assuntos: Acceptability ; Complement ; Computation ; Fuzzy ; Fuzzy logic ; Fuzzy set theory ; Turing machines
É parte de: Fundamenta informaticae, 2013, Vol.123 (3), p.305-315
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: First we define a new class of fuzzy Turing machines that we call Generalized Fuzzy Turing Machines. Our machines are equipped with rejecting states as well as accepting states. While we use a t-norm for computing degrees of accepting or rejecting paths, we use its dual t-conorm for computing the accepting or rejecting degrees of inputs. We naturally define when a generalized fuzzy Turing machine accepts or decides a fuzzy language. We prove that a fuzzy language L is decidable if and only if L and its complement are acceptable. Moreover, to each r.e. or co-r.e language L, we naturally correspond a fuzzy language which is acceptable by a generalized fuzzy Turing machine. A converse to this result is also proved. We also consider Atanasovs intuitionistic fuzzy languages and introduce a version of fuzzy Turing machine for studying their computability theoretic properties.
Idioma: Inglês

Voltar para lista de resultados