Lattice-valued fuzzy Turing machines: computing power, universality and efficiency

DOI10.1016/j.fss.2009.08.003zbMath1192.68265OpenAlexW2053717907WikidataQ62038206 ScholiaQ62038206MaRDI QIDQ1043325

Yong-Ming Li

Publication date: 7 December 2009

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2009.08.003

zbMATH Keywords

computational complexityrecursively enumerable languagefuzzy systems modeluniversal machinefuzzy Turing machinerecursive language

Mathematics Subject Classification ID

Related Items (4)

Fuzzy Turing machines: normal form and limitative theorems ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ Comments on some theories of fuzzy computation ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Complexity issues in Basic Logic
• Arithmetical complexity of fuzzy predicate logics -- a survey
• On the computing power of fuzzy Turing machines
• Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Approximation and universality of fuzzy Turing machines
• A note on Trillas' CHC models
• Fuzzy sets and systems. Theory and applications
• Metamathematics of fuzzy logic
• Characterizations of fuzzy finite automata.
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• A probabilistic model of computing with words
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Quantum Complexity Theory
• Lattice Automata
• Fuzzy algorithms
• Fuzzy algorithms
• Fuzzy discrete structures
• A new approach for the execution and adjustment of a fuzzy algorithm

This page was built for publication: Lattice-valued fuzzy Turing machines: computing power, universality and efficiency