readsasa.blogg.se

The second model is 2-way quantum finite state automaton (2QFA).

Nayek proposed a further generalization by allowing the QFA to perform several arbitrary measurements with intermediate unitary trans- formation at each step. Besides these two models of QFA there are also such models of QFA as “enhanced” quantum finite state automaton, latvian quantum finite state automaton, 1-way QFA with control languages, quantum finite state automaton with quantum and classical states (introduced by aharonov, kitaev and Nisan ). that the languages recognized by 1QFA’s form a proper subset of the regular languages. Whenever we mention one-way quantum finite automata we mean the model described by Konadacs et al. Hence, in this paper,we consider the measure many quantum finite automata described by Kondacs et al. showed that measure many one-way quantum finite automata can accept all languages that can be accepted by measure once one-way quantum finite automata. They have seemingly small difference, measure once quantum finite state automaton performs the mea- surement only at the end of computation,but for measure-many quantum finite state automaton the measure- ment will be performed by the automaton at every step of computation. The two most popular models of quantum finite state automaton are quantum finite state automaton introduced by Moore and Crutchfield (measure once quantum finite state automaton) and quan- tum finite state automaton introduced by Kondacs and Watrous (measure many quantum finite state auto- maton). 1-way quantum finite automaton (1QFA) can be seen as the simplest model of quantum automaton. A variety of models of quantum finite state automaton are used.

Likewise a quantum finite state automaton may be seen as basic model of finite state quantum machine. Received 6 April 2016 accepted published Ĭlassical finite state automaton is the very basic model of classical finite machine.