Intuitionistic fuzzy recursive enumerable languages and recursive languages

In this paper a new class of Fuzzy Turing Machine is introduced which is called Intuitionistic Fuzzy Turing Machine. This Intuitionistic Fuzzy Turing Machine uses t – norm for membership degree and its dual t – conorm for non-membership degree. We prove a theorem that guaranteed us sufficient condit...

Full description

Saved in:
Bibliographic Details
Main Authors: Rajasekar, M., Sumathi, V.
Format: Conference Proceeding
Language:English
Subjects:
Computation
Languages
Logic
Turing machines
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper a new class of Fuzzy Turing Machine is introduced which is called Intuitionistic Fuzzy Turing Machine. This Intuitionistic Fuzzy Turing Machine uses t – norm for membership degree and its dual t – conorm for non-membership degree. We prove a theorem that guaranteed us sufficient conditions for Intuitionistic Fuzzy recursive enumerable languages are closed under Intuitionistic Fuzzy Intersection. We show that Deterministic Intuitionistic Fuzzy Turing Machines and Nondeterministic Intuitionistic Fuzzy Turing Machines are not equivalent as far as the power of recognizing Intuitionistic Fuzzy languages is concerned.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.5135253