On a class of fuzzy computable functions
From MaRDI portal
Publication:5947561
DOI10.1016/S0165-0114(00)00014-2zbMath0983.03034MaRDI QIDQ5947561
Rafael Morales-Bueno, Ricardo Conejo, José-Luis Pérez-de-la-Cruz, Francisco Trigueor-Ruiz
Publication date: 17 April 2002
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-0114(00)00014-2
fuzzy languages; fuzzy relations; fuzzy computability; fuzzy programming language; fuzzy Turing machines
03E72: Theory of fuzzy sets, etc.
68N15: Theory of programming languages
03D10: Turing machines and related notions
Related Items
Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages, Automata theory based on complete residuated lattice-valued logic: Turing machines, On the computing power of fuzzy Turing machines
Cites Work
- Unnamed Item
- Unnamed Item
- Introduction to the concept of recursiveness of fuzzy functions
- Fuzzy subsets: A constructive approach
- Turing L-machines and recursive computability for L-maps
- A family of fuzzy programming languages
- Classical recursion theory. Vol. II
- FUZZY RECURSION, RET'S, AND ISOLS
- Flow diagrams, turing machines and languages with only two formation rules
- Fuzzy algorithms