搜索资源列表
lifegame_cpp
- 元胞自动机的c++实现，详细注释版 基于10*10矩阵的元胞自动机，可以自由设置初始状态和变化条件。还可以侦测循环状态的周期和起始位置。 侦测循环状态用了折半追尾的算法（我瞎起的名字，打个比方就是一个人1秒走1步，一个人2秒走一步，两个人碰上了就说明路是环状的）。 代码给有用的人参考一下,有详细注释。工程选择win32控制台工程。编译环境vc6.0或者vc2005都试验过了可以编译。 -Cellular Automata c++ implementation, det
ca
- 使用matlab 进行模拟仿真 对于元宝自动机 使用 simulink-simulink cellular automata matlab
fsm
- awk脚本生成C代码，用于有限状态自动机实现！-awk scr ipt to generate C code for finite state automata to achieve!
GameOfLife
- 利用MATLAB模拟的细胞自动机程序，可以借用来研究怎么写此类程序-Using MATLAB simulation of cellular automata program, you can borrow to study how to write such programs
2009-ANewMethodforMultiobjectiveOptimizationBased
- 2009 A New Method for Multiobjective Optimization BasedonLearning Automata
nfa
- Nfa simulator Non deterministic Automata
3c4f17957854
- 正则式到dfa的转化 正规式到有穷自动机的转化-Regular expression to dfa conversion of regular expression to the transformation of finite automata
Cellular-Automaton
- 元胞自动机的C程序，大概请问年度模拟到3.5以后，磁性开始稳定-Cellular automata C program
NumerosAleatorios
- Seedless random number generator that uses a state machine or finite automata to determine the random value
A-poor--regular-expression-matches
- 有穷自动机的实现，关于正则语言的学习。有助DFA的理解-Implementation of finite automata, on the regular language learning. Facilitate the understanding of DFA
NFAtoDFA(CPP)
- 用c++编程求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 -C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
NFAtoDFA
- It s a program that convert NFA(Non deterministic Finite Automata) to DFA(Deterministic Finite Automata). This article used in scanners and parsers to detect some pattern of input characters similar to tokens.
ALC
- Automata language computation programs in c-Automata language computation programs in c++
youqiongzidongjideshixian
- 无符号有穷自动机的实现！~编译原理实验！~-Unsigned Realization of finite automata! ~ Compilation Principle Experiment
cellular
- it cellular automata sim ulation
cellu-autlar
- it cellular automata simulation translation
cellular-automata
- so please do not put files on these two
automataKr
- This program is automata for Korea.Application Wizard application this automataKr Was created. This application demonstrates the basic use of the MFC, as well as the application Provides a framework for writing. In the application so that you can use
NFA-to-DFA
- Theory: NDFA: It is a mathematical model containing 5 tuples a) Q- finite non empty set elements of which are called as state. b) T- set of alphabets. c) δ- is a mapping function Q*{T {λ}}*2Q d) S-start state i.e. S ε Q e) F- F (su
CellularAutomata
- 能运行的CA元胞自动机程序，已调通，下载build即可运行-This is Cellular Automata program, you can just download, build and run it.