A probabilistic model of computing with words
From MaRDI portal
Publication:1776375
DOI10.1016/j.jcss.2004.08.006zbMath1075.68047OpenAlexW2071032337WikidataQ62049465 ScholiaQ62049465MaRDI QIDQ1776375
Publication date: 12 May 2005
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2004.08.006
Computing with wordsProbabilistic context-free grammarsProbabilistic finite automataProbabilistic Turing machinesQuantum automataQuantum models of computationStrings of words
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Approximation of fuzzy context-free grammars ⋮ Conversion of fuzzy automata into fuzzy regular expressions using transitive closure ⋮ An interval type-2 fuzzy model of computing with words ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ A formal model of semantic computing ⋮ Automata theory based on complete residuated lattice-valued logic: Pushdown automata ⋮ Grammar theory based on lattice-ordered monoid ⋮ Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Quantum automata and quantum grammars
- Quantum neural networks
- Characterization of sequential quantum machines
- Quantum pushdown automata
- Characterizations of 1-Way Quantum Finite Automata
- Automata Studies. (AM-34)
- Dense quantum coding and quantum finite automata
- Computational Complexity of Probabilistic Turing Machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
- Probabilistic automata
- Probabilistic Turing Machines and Computability
- Probabilistic and weighted grammars
- Applying Probability Measures to Abstract Languages
- Quantum computers.
This page was built for publication: A probabilistic model of computing with words
