Fuzzy and probabilistic programs

DOI10.1016/S0020-0255(76)90986-5zbMath0334.68013OpenAlexW2053825369MaRDI QIDQ1229093

Eugene S. Santos

Publication date: 1976

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(76)90986-5

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Turing machines and related notions (03D10) Algorithms in computer science (68W99) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)

Related Items

On the computing power of fuzzy Turing machines, 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, The lattice-valued Turing machines and the lattice-valued type 0 grammars, Fuzzy grammars and recursively enumerable fuzzy languages, Fuzzy subsets: A constructive approach, Automata theory based on complete residuated lattice-valued logic: Turing machines, A new approach for the execution and adjustment of a fuzzy algorithm, FUZZY GRAMMAR FOR HANDLING FUZZY ALGORITHMS, Turing L-machines and recursive computability for L-maps, Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Cites Work

• Unnamed Item
• Unnamed Item
• Some definitional suggestions for automata theory
• Machines, Programs and Languages
• Fuzzy sets
• Nondeterministic Algorithms
• Fuzzy algorithms
• Maximin sequential-like machines and chains
• Fuzzy algorithms
• On the Execution of Fuzzy Programs Using Finite-State Machines
• Computability by Probabilistic Turing Machines