Automata theory based on complete residuated lattice-valued logic: Turing machines
From MaRDI portal
Publication:690917
DOI10.1016/j.fss.2012.03.001zbMath1252.03099OpenAlexW2024250534WikidataQ62049409 ScholiaQ62049409MaRDI QIDQ690917
Lihua Wu, Hongyan Xing, Dao Wen Qiu
Publication date: 29 November 2012
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2012.03.001
Turing machinesnonclassical logicrecursively enumerable languagesresiduated latticesuniversal Turing machines
Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)
Related Items
Weak bisimulations for fuzzy automata ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ On typical hesitant fuzzy automata ⋮ On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization ⋮ On closure properties of \(\mathcal{L}\)-valued linear languages ⋮ GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED ⋮ On equality between fuzzy context-free and fuzzy adult 0L languages ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Automata theory based on quantum logic: Some characterizations
- Turing machines, transition systems, and interaction
- 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
- 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
- Metamathematics of fuzzy logic
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- Fuzzy logic, continuity and effectiveness
- 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
- Automata theory based on quantum logic: reversibilities and pushdown automata
- The logic of inexact concepts
- FUZZY RECURSION, RET'S, AND ISOLS
- On Fuzzy Logic I Many‐valued rules of inference
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Multi-valued Logics, Effectiveness and Domains
- Effectiveness and multivalued logics
- Fuzzy algorithms
- Fuzzy algorithms
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Abstract residuation over lattices
- Axiom schemes for m-valued propositions calculi
- Fuzzy discrete structures
- Fuzzy logic. Mathematical tools for approximate reasoning
- On a class of fuzzy computable functions
