Fuzzy and probabilistic programs
From MaRDI portal
Cites work
- Computability by Probabilistic Turing Machines
- Fuzzy algorithms
- Fuzzy algorithms
- Fuzzy sets
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3492140 (Why is no real title available?)
- Machines, Programs and Languages
- Maximin sequential-like machines and chains
- Nondeterministic Algorithms
- On the Execution of Fuzzy Programs Using Finite-State Machines
- Some definitional suggestions for automata theory
Cited in
(12)- Decidability, partial decidability and sharpness relation for L-subsets
- L.P.L. A fuzzy programming language. I: Syntactic aspects
- L.P.L. - A fuzzy programming language. II: Semantic aspects
- Fuzzy grammars and recursively enumerable fuzzy languages
- Fuzzy subsets: A constructive approach
- Turing L-machines and recursive computability for L-maps
- The lattice-valued Turing machines and the lattice-valued type 0 grammars
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- FUZZY GRAMMAR FOR HANDLING FUZZY ALGORITHMS
- A new approach for the execution and adjustment of a fuzzy algorithm
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- On the computing power of fuzzy Turing machines
This page was built for publication: Fuzzy and probabilistic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229093)
