English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Turing machine is an abstract concept of a computing device whichintroduced new models for computation. The idea of Fuzzy algorithms defined byZadeh and Lee was followed by introducing Fuzzy Turing Machine (FTM) to createa platform for a new fuzzy computation model. Then, in his investigations onits computational power, Wiedermann showed that FTM is able to solveundecidable problems. His suggested FTM structure, which highly resembles theoriginal definition was one of the most well-known classical definitions of FTMlately.To improve some of its weaknesses and vague points which will bediscussed extensively in this paper, we will develop a more complete definitionfor fuzzy Turing machines. Our proposed definition of FTM, which encompassesthe conventional definition, is motivated from the definition of General FuzzyAutomata (GFA) introduced by Doostfatemeh and Kremer. As it improved theconventional definition of fuzzy automata, especially the problem of membershipassignment and multi-membership resolution, we also improved the same aspectsof FTM through the definition of Comprehensive Fuzzy Turing Machine (CFTM). Inaddition, we address on some possible vaguenesses in FTM was not the subject offocus in fuzzy automata. As example, we investigate the issue of multi-path andmulti-direction which are possible in case of nondeterminism. Finally, we showthe simplicity, applicability and computational efficiency of the CFTM throughan explanatory example.

Comprehensive Fuzzy Turing Machines, An Evolution to the Concept of Finite State Machine Control