A probabilistic model of computing with words

DOI10.1016/J.JCSS.2004.08.006zbMATH Open1075.68047DBLPjournals/jcss/QiuW05OpenAlexW2071032337WikidataQ62049465 ScholiaQ62049465MaRDI QIDQ1776375FDOQ1776375

Authors: Huaiqing Wang, Daowen Qiu 

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

Recommendations

• Probabilistic automata for computing with words
• Computation of moments for probabilistic finite-state automata
• scientific article; zbMATH DE number 4001489
• scientific article; zbMATH DE number 1154591
• scientific article; zbMATH DE number 2038730

zbMATH Keywords

Computing with wordsProbabilistic context-free grammarsProbabilistic finite automataProbabilistic Turing machinesQuantum automataQuantum models of computationStrings of words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Title not available (Why is that?)
• Probabilistic automata
• Title not available (Why is that?)
• Quantum Complexity Theory
• Title not available (Why is that?)
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Computational Complexity of Probabilistic Turing Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Applying Probability Measures to Abstract Languages
• Title not available (Why is that?)
• Quantum automata and quantum grammars
• Characterizations of 1-Way Quantum Finite Automata
• Dense quantum coding and quantum finite automata
• Probabilistic Turing Machines and Computability
• Automata Studies. (AM-34)
• Title not available (Why is that?)
• Quantum computers.
• Quantum neural networks
• Characterization of sequential quantum machines
• Quantum pushdown automata
• Probabilistic and weighted grammars
• Title not available (Why is that?)
• Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages

Cited In (13)

• Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
• Approximation of fuzzy context-free grammars
• Automata theory based on complete residuated lattice-valued logic: Turing machines
• Automata theory based on complete residuated lattice-valued logic: Pushdown automata
• Conversion of fuzzy automata into fuzzy regular expressions using transitive closure
• Switching and Learning in Feedback Systems
• On Turing's formula for word probabilities
• Computation of moments for probabilistic finite-state automata
• Probabilistic automata for computing with words
• Probabilistic model for the growth of thesauri
• An interval type-2 fuzzy model of computing with words
• A formal model of semantic computing
• Grammar theory based on lattice-ordered monoid

This page was built for publication: A probabilistic model of computing with words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776375)