October 19,2007 Vice Premier Wu Yi,PRC On behalf of Chinese government,I would like to congratulate the 20th Foundation of World Federation of Acupuncture-Moxibustion Societies(WFAS)and International Acupuncture Congr...October 19,2007 Vice Premier Wu Yi,PRC On behalf of Chinese government,I would like to congratulate the 20th Foundation of World Federation of Acupuncture-Moxibustion Societies(WFAS)and International Acupuncture Congress which is to be held in Beijing,China.And also I give my warm welcome and regards to TCM/Acupuncture colleagues all over the world.展开更多
1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has b...1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has been shown by Moore and Crutchfield as well as Konadacs and Watrous that 1QFA can’t accept all regular language. In this paper, we show different language recognizing capabilities of our model 1-way multihead QFAs. New results presented in this paper are the following ones: 1) We show that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages. 2) A language which can’t be accepted by 1-way deterministic 2-head finite state automaton (1DFA((2)) can be accepted by 1QFA(2) with bounded error. 3) 1QFA(2) is more powerful than 1-way reversible 2-head finite state automaton (1RMFA(2)) with respect to recognition of language.展开更多
文摘October 19,2007 Vice Premier Wu Yi,PRC On behalf of Chinese government,I would like to congratulate the 20th Foundation of World Federation of Acupuncture-Moxibustion Societies(WFAS)and International Acupuncture Congress which is to be held in Beijing,China.And also I give my warm welcome and regards to TCM/Acupuncture colleagues all over the world.
文摘1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has been shown by Moore and Crutchfield as well as Konadacs and Watrous that 1QFA can’t accept all regular language. In this paper, we show different language recognizing capabilities of our model 1-way multihead QFAs. New results presented in this paper are the following ones: 1) We show that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages. 2) A language which can’t be accepted by 1-way deterministic 2-head finite state automaton (1DFA((2)) can be accepted by 1QFA(2) with bounded error. 3) 1QFA(2) is more powerful than 1-way reversible 2-head finite state automaton (1RMFA(2)) with respect to recognition of language.
