Fuzzy and Intuitionistic Fuzzy Turing Machines
| Autor: | Morteza Moniri |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Discrete mathematics
Algebra and Number Theory Theoretical computer science Mathematics::General Mathematics Super-recursive algorithm Probabilistic Turing machine Turing machine examples Theoretical Computer Science law.invention symbols.namesake Turing machine Computational Theory and Mathematics Non-deterministic Turing machine law symbols Fuzzy number Fuzzy set operations Universal Turing machine ComputingMethodologies_GENERAL Information Systems Mathematics |
| Zdroj: | Fundamenta Informaticae. 123:305-315 |
| ISSN: | 0169-2968 |
| Popis: | 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 Atanasov's intuitionistic fuzzy languages and introduce a version of fuzzy Turing machine for studying their computability theoretic properties. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|