Automata theory based on complete residuated lattice-valued logic: Turing machines
From MaRDI portal
Publication:690917
DOI10.1016/J.FSS.2012.03.001zbMATH Open1252.03099OpenAlexW2024250534WikidataQ62049409 ScholiaQ62049409MaRDI QIDQ690917FDOQ690917
Authors: Lihua Wu, Hongyan Xing, Daowen 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
Recommendations
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
residuated latticesTuring machinesnonclassical logicrecursively enumerable languagesuniversal Turing machines
Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)
Cites Work
- On Fuzzy Logic I Many‐valued rules of inference
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Metamathematics of fuzzy logic
- The logic of inexact concepts
- A treatise on many-valued logics
- Quantum Complexity Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- Title not available (Why is that?)
- A note on Trillas' CHC models
- Characterizations of fuzzy finite automata.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Fuzzy logic. Mathematical tools for approximate reasoning
- 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
- Axiom schemes for m-valued propositions calculi
- Fuzzy algorithms
- Turing machines, transition systems, and interaction
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Automata theory based on quantum logic: Some characterizations
- Abstract residuation over lattices
- Title not available (Why is that?)
- On the computing power of fuzzy Turing machines
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Title not available (Why is that?)
- A probabilistic model of computing with words
- Fuzzy discrete structures
- 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
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- Fuzzy logic, continuity and effectiveness
- Interactive computation: stepping stone in the pathway from classical to developmental computation
- Title not available (Why is that?)
- FUZZY RECURSION, RET'S, AND ISOLS
- Multi-valued Logics, Effectiveness and Domains
- Effectiveness and multivalued logics
- Fuzzy algorithms
- On a class of fuzzy computable functions
- Approximation and universality of fuzzy Turing machines
Cited In (18)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- On typical hesitant fuzzy automata
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization
- Weak bisimulations for fuzzy automata
- \(L\)-fuzzy automata theory: some characterizations via general fuzzy operators
- On \(L\)-fuzzy automata, coalgebras and dialgebras: associated categories and \(L\)-fuzzy topologies
- Categories of Automata and Languages Based on a Complete Residuated Lattice
- Automata theory based on complete residuated lattice-valued logic. II
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- A comprehensive survey on formal concept analysis, its research trends and applications
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- Equivalence in automata theory based on complete residuated lattice-valued logic
- On closure properties of \(\mathcal{L}\)-valued linear languages
- On equality between fuzzy context-free and fuzzy adult 0L languages
- The lattice-valued Turing machines and the lattice-valued type 0 grammars
This page was built for publication: Automata theory based on complete residuated lattice-valued logic: Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690917)
