Finite automata and unary languages
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
FuzzyTree crossover for multi-valued stock valuation
Information Sciences: an International Journal
Stability analysis and design of Takagi-Sugeno fuzzy systems
Information Sciences: an International Journal
A similarity measure for fuzzy rulebases based on linguistic gradients
Information Sciences: an International Journal
Genetically optimized fuzzy polynomial neural networks with fuzzy set-based polynomial neurons
Information Sciences: an International Journal
Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks
IEEE Transactions on Fuzzy Systems
Hi-index | 0.09 |
For better target tracking, this paper presents a new viewpoint that is the states fusion of various fuzzy automata, and mainly discusses the algorithm of the fusion on the states of the fuzzy automata based on Bayesian theory and fuzzy knowledge in detail, respectively. The recurrent neural network architecture corresponding to fuzzy automata is provided for the states fusion of fuzzy automata and the simulation results are given. The simulation results show target tracking based on the states fusion of the fuzzy automata is better than that of single state information of the fuzzy automata relatively. Moreover, the application of fusion of fuzzy automata to track recognition is given. Thus, it will be a theoretic base for the application of any automata. Finally, some problems and development trends on fuzzy automata and neural networks are presented for future research.