{"title":"论图灵机接受模糊语言的复杂性","authors":"Yingjun Pan, Tie Zou","doi":"10.1109/FSKD.2012.6233747","DOIUrl":null,"url":null,"abstract":"Based on the definition of single-tape Fuzzy Non-deterministic Turing Machine (FNTM), this article discussed in details the process of FNTM accepting language and researched the computational complexity of fuzzy Turing Machine (TM) accepting ?-cut language by using the Deterministic Turing Machine (DTM) to simulate its process, thus drawing the conclusion that the judgment of FNTM accepting ?-cut language is a matter of the NP-completeness, and that it is not essentially helpful to adjust the membership degree in facing the time complexity problem when simulating the process of FNTM accepting the language.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the complexity of Turing machine accepting fuzzy language\",\"authors\":\"Yingjun Pan, Tie Zou\",\"doi\":\"10.1109/FSKD.2012.6233747\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the definition of single-tape Fuzzy Non-deterministic Turing Machine (FNTM), this article discussed in details the process of FNTM accepting language and researched the computational complexity of fuzzy Turing Machine (TM) accepting ?-cut language by using the Deterministic Turing Machine (DTM) to simulate its process, thus drawing the conclusion that the judgment of FNTM accepting ?-cut language is a matter of the NP-completeness, and that it is not essentially helpful to adjust the membership degree in facing the time complexity problem when simulating the process of FNTM accepting the language.\",\"PeriodicalId\":337941,\"journal\":{\"name\":\"International Conference on Fuzzy Systems and Knowledge Discovery\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Fuzzy Systems and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2012.6233747\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Fuzzy Systems and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2012.6233747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the complexity of Turing machine accepting fuzzy language
Based on the definition of single-tape Fuzzy Non-deterministic Turing Machine (FNTM), this article discussed in details the process of FNTM accepting language and researched the computational complexity of fuzzy Turing Machine (TM) accepting ?-cut language by using the Deterministic Turing Machine (DTM) to simulate its process, thus drawing the conclusion that the judgment of FNTM accepting ?-cut language is a matter of the NP-completeness, and that it is not essentially helpful to adjust the membership degree in facing the time complexity problem when simulating the process of FNTM accepting the language.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
