Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Quantum_finite_automata> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Quantum_finite_automata abstract "In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFA's are, in turn, special cases of geometric finite automata or topological finite automata.The automata work by accepting a finite-length string of letters from a finite alphabet , and assigning to each such string a probability indicating the probability of the automaton being in an accept state; that is, indicating whether the automaton accepted or rejected the string.The languages accepted by QFA's are not the regular languages of deterministic finite automata, nor are they the stochastic languages of probabilistic finite automata. Study of these quantum languages remains an active area of research.".
- Quantum_finite_automata wikiPageExternalLink 9903014.
- Quantum_finite_automata wikiPageID "7926008".
- Quantum_finite_automata wikiPageRevisionID "599918131".
- Quantum_finite_automata author "L. Accardi".
- Quantum_finite_automata hasPhotoCollection Quantum_finite_automata.
- Quantum_finite_automata id "Q/q076330".
- Quantum_finite_automata title "Quantum stochastic processes".
- Quantum_finite_automata subject Category:Automata_theory.
- Quantum_finite_automata subject Category:Quantum_information_theory.
- Quantum_finite_automata comment "In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains.".
- Quantum_finite_automata label "Autômato quântico".
- Quantum_finite_automata label "Quantum finite automata".
- Quantum_finite_automata sameAs Autômato_quântico.
- Quantum_finite_automata sameAs m.026kb89.
- Quantum_finite_automata sameAs Q176837.
- Quantum_finite_automata sameAs Q176837.
- Quantum_finite_automata wasDerivedFrom Quantum_finite_automata?oldid=599918131.
- Quantum_finite_automata isPrimaryTopicOf Quantum_finite_automata.