This paper presents an evolution strategy to induce fuzzy finite-state automata from examples of fuzzy languages. The coding, fitness function of a generated automaton and corresponding mutation operators are given re...This paper presents an evolution strategy to induce fuzzy finite-state automata from examples of fuzzy languages. The coding, fitness function of a generated automaton and corresponding mutation operators are given respectively. The application example given at last shows the effectiveness of the proposed evolution strategy for automata induction.展开更多
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.展开更多
Some concepts in Fuzzy Generalized Automata （FGA） are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts： the first is called E-r...Some concepts in Fuzzy Generalized Automata （FGA） are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts： the first is called E-reduction which contracts equivalent states, and the second is called RE-reduction which removes retrievable states. Finally an example is given to illuminate the algorithm of minimization.展开更多
In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heurist...In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.展开更多
At present, there has been an increasing interest in neuron-fuzzy systems, the combinations of artificial neural networks with fuzzy logic. In this paper, a definition of fuzzy finite state automata （FFA） is introdu...At present, there has been an increasing interest in neuron-fuzzy systems, the combinations of artificial neural networks with fuzzy logic. In this paper, a definition of fuzzy finite state automata （FFA） is introduced and fuzzy knowledge equivalence representations between neural networks, fuzzy systems and models of automata are discussed. Once the network has been trained, we develop a method to extract a representation of the FFA encoded in the recurrent neural network that recognizes the training rules.展开更多
This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are i...This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are investigated, and the relationships between the eigenvalues and the limit set are developed. As an application, the nilpotent problem of elementary cellular automata(ECA) known as algorithmically undecidable is considered, and all the nilpotent ECA are found out which consists of rules 0, 8, 64, 239, 253, 255.展开更多
文摘This paper presents an evolution strategy to induce fuzzy finite-state automata from examples of fuzzy languages. The coding, fitness function of a generated automaton and corresponding mutation operators are given respectively. The application example given at last shows the effectiveness of the proposed evolution strategy for automata induction.
文摘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 Supported by National Natural Science Foundation of China (No.60074014)
文摘Some concepts in Fuzzy Generalized Automata （FGA） are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts： the first is called E-reduction which contracts equivalent states, and the second is called RE-reduction which removes retrievable states. Finally an example is given to illuminate the algorithm of minimization.
文摘In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.
基金Youth Science and Technology Foundation of Sichuan (No. L080011YF021104)
文摘At present, there has been an increasing interest in neuron-fuzzy systems, the combinations of artificial neural networks with fuzzy logic. In this paper, a definition of fuzzy finite state automata （FFA） is introduced and fuzzy knowledge equivalence representations between neural networks, fuzzy systems and models of automata are discussed. Once the network has been trained, we develop a method to extract a representation of the FFA encoded in the recurrent neural network that recognizes the training rules.
基金supported by the National Natural Science Foundation of China under Grant Nos.61473189,61374176,61203142 and 61203073a Doctoral Program of High Education of China under Grant No.20110073120027partly by the Excellent Young Technology Innovation Foundation of Hebei University of Technology under Grant No.2012005
文摘This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are investigated, and the relationships between the eigenvalues and the limit set are developed. As an application, the nilpotent problem of elementary cellular automata(ECA) known as algorithmically undecidable is considered, and all the nilpotent ECA are found out which consists of rules 0, 8, 64, 239, 253, 255.
