搜索资源列表
MCMProjects
- 我备战2010数学建模美赛所精心准备的算法资料，一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现，来解决一个问题。其中一些是自己编写，其它的也是由网上找到后经过修改编译通过的。比赛结果还不错，一个M，现在把资料共享出来，希望对大家有所帮助，算法主要有模拟退火，遗传算法，蒙特卡罗算法，蚁群算法，粒子群算法，元胞自动机，Dijkstra，最小生成树算法，二分图最大匹配算法，最大流算法，动态规划算法，分支定界法，排队论算法，决策论算法等，我写了个说明文件，列的挺详细的-I a
mcm2009a
- 绝对极品！！美国数学建模2009年A篇优秀论文，附带MATLAB源程序，解决了于环岛问题的仿真问题！ 基于元胞自动机的交通系统（环岛）建模与模拟实例，MATLAB解决。 MCM-2009a题论文+答案-Absolutely superb! ! A 2009 American Mathematical modeling of excellent papers, with MATLAB source code to solve the problem of simulation
NFA12
- NON diterministic finite automata to dfa
CyclicCellulaAutomata
- A matlab simulation of Cyclic Cellula Automata
sand
- 沙堆的元胞自动 元胞自动机 matlab编写-Sand of Cellular Automata Cellular Automata write matlab
2009-ANewMethodforMultiobjectiveOptimizationBased
- 2009 A New Method for Multiobjective Optimization BasedonLearning Automata
DFA
- deterministic finite automata
nfa
- Nfa simulator Non deterministic Automata
3c4f17957854
- 正则式到dfa的转化 正规式到有穷自动机的转化-Regular expression to dfa conversion of regular expression to the transformation of finite automata
SyntaxAnalysisL-R
- 实现编译原理的LL（1）和LR（0） （1）语法分析LL（1） （2）语法分析LR（0） （3）输出分析过程如First、Follow集、预测分析表 （4）输出预测分析过程、LR（0）自动机 （5）对输入字符串的验证-Principle to achieve compile LL (1) and LR (0) (1) parsing LL (1) (2) parsing LR (0) (3) the output of the process, such
Compiler_report
- 编译器实现实验报告，包括扫描器(自动机实现)，语法分析，语义分析，实现输入加减乘除的式子，导出相关四元式-Experimental compiler implementation report, including the scanner (Automata), syntax analysis, semantic analysis, subtraction multiplication and division of the input formula, export-related four-
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
main
- This code simulate a air conditioner system with automata base programming paradigm-This code simulate a air conditioner system with automata base programming paradigm
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
Ecodynamica
- 什么是Ecodynamica? Ecodynamica是普通的工具和二维元胞自动机1(CAs)。-What is Ecodynamica? Ecodynamica ordinary tools and two-dimensional cellular automata 1 (CAs).
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