Fuzzy and Intuitionistic Fuzzy Turing Machines

@article{Moniri2013FuzzyAI,
  title={Fuzzy and Intuitionistic Fuzzy Turing Machines},
  author={Morteza Moniri},
  journal={Fundam. Inform.},
  year={2013},
  volume={123},
  pages={305-315}
}
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… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

2nd edition

  • J. E. Hopcroft, R. Motwani, J. D. Ullman
  • Introduction to Automata Theory, Languages and…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…