Automata theory based on complete residuated lattice-valued logic: Turing machines
From MaRDI portal
Publication:690917
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
Cites work
- scientific article; zbMATH DE number 3648691 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 845841 (Why is no real title available?)
- scientific article; zbMATH DE number 2199279 (Why is no real title available?)
- scientific article; zbMATH DE number 2206366 (Why is no real title available?)
- scientific article; zbMATH DE number 3392404 (Why is no real title available?)
- A note on Trillas' CHC models
- A probabilistic model of computing with words
- A treatise on many-valued logics
- Abstract residuation over lattices
- Approximation and universality of fuzzy Turing machines
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on quantum logic: Some characterizations
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Axiom schemes for m-valued propositions calculi
- Characterizations of fuzzy finite automata.
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Effectiveness and multivalued logics
- FUZZY RECURSION, RET'S, AND ISOLS
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- Fuzzy algorithms
- Fuzzy algorithms
- Fuzzy and probabilistic programs
- Fuzzy discrete structures
- Fuzzy logic, continuity and effectiveness
- Fuzzy logic. Mathematical tools for approximate reasoning
- Fuzzy subsets: A constructive approach
- Interactive computation: stepping stone in the pathway from classical to developmental computation
- Introduction to the concept of recursiveness of fuzzy functions
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Linear logic
- Metamathematics of fuzzy logic
- Multi-valued Logics, Effectiveness and Domains
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Fuzzy Logic I Many‐valued rules of inference
- On a class of fuzzy computable functions
- On the computing power of fuzzy Turing machines
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Quantum Complexity Theory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The logic of inexact concepts
- Turing machines, transition systems, and interaction
Cited in
(18)- \(L\)-fuzzy automata theory: some characterizations via general fuzzy operators
- On \(L\)-fuzzy automata, coalgebras and dialgebras: associated categories and \(L\)-fuzzy topologies
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Weak bisimulations for fuzzy automata
- Categories of Automata and Languages Based on a Complete Residuated Lattice
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- On equality between fuzzy context-free and fuzzy adult 0L languages
- Automata theory based on complete residuated lattice-valued logic. II
- The lattice-valued Turing machines and the lattice-valued type 0 grammars
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization
- On closure properties of \(\mathcal{L}\)-valued linear languages
- A comprehensive survey on formal concept analysis, its research trends and applications
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- On typical hesitant fuzzy automata
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
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)
