To model the operation of food traceability, features of food supply chain are studied. The aim of the paper is to build an abstract model of food traceability, and to gain better understanding of food traceability an...To model the operation of food traceability, features of food supply chain are studied. The aim of the paper is to build an abstract model of food traceability, and to gain better understanding of food traceability and food safety. Based on the analysis of consumers＇ behavior of searching for traceability information, a finite state automaton for food traceability is presented by using automata theory. The states of the food supply chain are represented by a state transition diagram. The automaton in this paper simulates the entire food supply chain and provides a theoretical basis for the behavior description and structural design of a food traceability system.展开更多
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.展开更多
基金supported by the Science and Technology Public Projects of Sichuan under Grant No. 07GF001-0032010 Ministry of Science and Technology Innovation Fund for SMEs under Grant No. 10C26225123015
文摘To model the operation of food traceability, features of food supply chain are studied. The aim of the paper is to build an abstract model of food traceability, and to gain better understanding of food traceability and food safety. Based on the analysis of consumers＇ behavior of searching for traceability information, a finite state automaton for food traceability is presented by using automata theory. The states of the food supply chain are represented by a state transition diagram. The automaton in this paper simulates the entire food supply chain and provides a theoretical basis for the behavior description and structural design of a food traceability system.
文摘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.
