Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
From MaRDI portal
Publication:5275234
DOI10.3233/JIFS-152489zbMath1368.68239MaRDI QIDQ5275234
Antonio Diego Silva Farias, Luiz Ranyer de Araújo Lopes, Regivan H. N. Santiago, Benjamín René Callejas Bedregal
Publication date: 11 July 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
Related Items
On typical hesitant fuzzy automata, On closure properties of \(\mathcal{L}\)-valued linear languages, Quantum Reversible Fuzzy Grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Aggregating fuzzy implications
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Turing machines, transition systems, and interaction
- On the computing power of fuzzy Turing machines
- Approximation and universality of fuzzy Turing machines
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Introduction to the concept of recursiveness of fuzzy functions
- Fuzzy subsets: A constructive approach
- Fuzzy and probabilistic programs
- Fuzzy logic, continuity and effectiveness
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Real number computability and domain theory
- On the definitions of computable real continuous functions
- FUZZY RECURSION, RET'S, AND ISOLS
- Quantum theory, the Church–Turing principle and the universal quantum computer
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Effectiveness and multivalued logics
- Fuzzy sets
- Fuzzy algorithms
- Fuzzy algorithms
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Statistical Metrics
- On a class of fuzzy computable functions
