Approximation and universality of fuzzy Turing machines

DOI10.1007/s11432-008-0089-yzbMath1151.68011OpenAlexW2164645885WikidataQ62038214 ScholiaQ62038214MaRDI QIDQ954457

Yong-Ming Li

Publication date: 10 November 2008

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-008-0089-y

zbMATH Keywords

fuzzy algorithmfuzzy Turing machinefuzzy recursive languagefuzzy recursively enumerable languageuniversal fuzzy Turing machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of fuzzy sets, etc. (03E72) Turing machines and related notions (03D10)

Related Items

Approximation of fuzzy context-free grammars, Weak Second‐Order Arithmetic and Finite Automata, Automata theory based on complete residuated lattice-valued logic: Turing machines, Lattice-valued fuzzy Turing machines: computing power, universality and efficiency, Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Cites Work

• 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
• Metamathematics of fuzzy logic
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• Triangular norms
• Approximation and robustness of fuzzy finite automata
• Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
• An approach to measure the robustness of fuzzy reasoning
• Deterministic Acceptors of Regular Fuzzy Languages
• Quantum Complexity Theory
• Fuzzy algorithms
• Fuzzy algorithms
• A new approach for the execution and adjustment of a fuzzy algorithm