| 1. | A feasible method for achieving finite automaton
有限自动机的类类型实现方法 |
| 2. | Minimize connective finite automata and its complexity
连接型自动机的极小化及其复杂性 |
| 3. | Repeated prisoner ' s dilemma game model based on mealy automaton
自动机的重复囚徒困境博弈模型 |
| 4. | Study of improved learning rules of fuzzy neural networks
一种基于有限运行时间自动机的基因网络模型 |
| 5. | Evolution rules of elementary cellular automaton based on karnaugh map
基于卡诺图初等元胞自动机的演化规则 |
| 6. | Remove irrelevant atomic formulas for timed automaton model checking
时间自动机的模型检验中消除无关原子约束 |
| 7. | Some characteristics of ring theory andgraph theory on finite group automata
有限群自动机的若干环论与图论性质 |
| 8. | One of them is a learning task of cellular automata rules
其中一个问题为细胞自动机的规则学习，属于机器学习范畴。 |
| 9. | Land - cover simulation and forcast of melmeg wetland using cellular automata
基于元胞自动机的莫莫格湿地土地覆被预测模拟 |
