A probabilistic model of computing with words

DOI10.1016/J.JCSS.2004.08.006MaRDI QIDQ1776375zbMATH OpenOpenAlexDBLPWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3825216 (Why is no real title available?)
• scientific article; zbMATH DE number 3731374 (Why is no real title available?)
• scientific article; zbMATH DE number 3765145 (Why is no real title available?)
• scientific article; zbMATH DE number 3485226 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 757714 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Applying Probability Measures to Abstract Languages
• Automata Studies. (AM-34)
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Characterization of sequential quantum machines
• Characterizations of 1-Way Quantum Finite Automata
• Computational Complexity of Probabilistic Turing Machines
• Dense quantum coding and quantum finite automata
• Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
• Probabilistic Turing Machines and Computability
• Probabilistic and weighted grammars
• Probabilistic automata
• Quantum Complexity Theory
• Quantum automata and quantum grammars
• Quantum computers.
• Quantum neural networks
• Quantum pushdown automata
• Quantum theory, the Church–Turing principle and the universal quantum computer

Cited in

(13)

• Grammar theory based on lattice-ordered monoid
• 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
• On Turing's formula for word probabilities
• Computation of moments for probabilistic finite-state automata
• Switching and Learning in Feedback Systems
• Probabilistic automata for computing with words
• An interval type-2 fuzzy model of computing with words
• Probabilistic model for the growth of thesauri
• A formal model of semantic computing

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)