Approximation and universality of fuzzy Turing machines

DOI10.1007/S11432-008-0089-YMaRDI QIDQ954457zbMATH OpenOpenAlexWikidataFDO

Authors Yongming 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

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

Recommendations

• On a restricted universal fuzzy Turing machine
• On the computing power of fuzzy Turing machines
• scientific article; zbMATH DE number 2206366
• Classical Computability and Fuzzy Turing Machines
• Fuzzy and intuitionistic fuzzy Turing machines

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1202379 (Why is no real title available?)
• scientific article; zbMATH DE number 1093825 (Why is no real title available?)
• scientific article; zbMATH DE number 1862743 (Why is no real title available?)
• A new approach for the execution and adjustment of a fuzzy algorithm
• An approach to measure the robustness of fuzzy reasoning
• Approximation and robustness of fuzzy finite automata
• Arithmetical complexity of fuzzy predicate logics -- a survey
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• Complexity issues in Basic Logic
• Deterministic Acceptors of Regular Fuzzy Languages
• Fuzzy algorithms
• Fuzzy algorithms
• Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Metamathematics of fuzzy logic
• Quantum Complexity Theory
• Triangular norms

Cited in

(13)

• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
• Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
• Approximation of fuzzy context-free grammars
• Automata theory based on complete residuated lattice-valued logic: Turing machines
• On a restricted universal fuzzy Turing machine
• Fuzzy Turing machines: normal form and limitative theorems
• The equivalence between fuzzy Mealy and fuzzy Moore machines
• Fuzzy and intuitionistic fuzzy Turing machines
• On the computing power of fuzzy Turing machines
• scientific article; zbMATH DE number 2206366 (Why is no real title available?)
• Classical Computability and Fuzzy Turing Machines
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• Weak Second‐Order Arithmetic and Finite Automata

This page was built for publication: Approximation and universality of fuzzy Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954457)