搜索资源列表
RunFA
- 构造相应文法的有穷状态自动机自动机，运行此自动机，识别一个字符串是否是该文法的句子-Construct a corresponding grammar finite state machine automaton, run this automaton to identify whether a string is the grammar of the sentence
Conway
- Conway The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.[1] It is the best-known example of a cellular automaton.
Life-1
- "Conway game", which redirects to here, can also refer to games as defined by surreal numbers, which John Conway also developed. Gosper s Glider Gun creating "gliders". The Game of Life, also known simply as Life, is a cellular automaton devis
lex_yacc.pdf
- A compiler or interptreter for a programminning language is often decomposed into two parts: Read the source program and discover its structure. Process this structure, e.g. to generate the target program. Lex and Yacc can generate program f
AjaxParser
- 一个VC++有穷自动机分析内核的源代码，为 DocWizard 做词法分析准备，本分析内核可以在不改变代码的情况下分析不同的 DFA……有意思吧，看看代码就会明白-VC++ there is a finite automaton of the kernel source code, to prepare for the DocWizard do lexical analysis, this analysis does not change the kernel code in the case
librfa-0.0.tar
- 通用库，允许递归实时非确定性设置自动机施工时间的确定性-General purpose library that allows the construction of recursive deterministic automaton in real-time from non-deterministic settings
yuanbaozidongji
- 三个简单的c语言元胞自动机代码，cellular automaton -Three simple cellular automaton code
matlabcellarautomatonGameofLifesourcecode
- matlab 元胞自动机的生命游戏源代码-matlab cellular automaton Game of Life source code
Lift_status
- 电梯运行程序部分代码 空闲/运行/停靠 自动机模型-Elevator run the program part of the code free/run/stop automaton model
C_programming_style_to_finite_automaton_to_achieve
- C编程正则式到有穷自动机实现的经典代码 C programming is the style to a finite automaton to achieve the classic code-C programming is the style to a finite automaton to achieve the classic code
KeywordSpotting
- 多串匹配的AC算法/多字符串匹配/多字符串检测/多字符串识别/Aho-Corasick自动机/ahocorasick自动机/AC自动机。/Java实现 该程序是一个高效的，能处理较大的Unicode字符文本（包括要检测的文本和关键词文本）的关键词匹配程序，因此程序的输入为input.txt为待检测文本，keywords.txt为关键词文本，文件夹test1，test2，test3分别是三组自己设定的input和keywords，可自行任意添加删改，运行程序前先将一组拷贝至D:\。 程序将
elementaryCellularAutomata1234
- Simulates any 1D nearest-neighbour binary cellular automaton
elementaryCellularAutomata
- Simulates any 1D nearest-neighbour binary cellular automaton
maxamin
- 1.自动机以状态转换矩阵的方式在计算机内部进行表示；2.根据NFA确定化的方法，将NFA确定化；3.判断自动机是否以最小化，若不是将其最小化；4.以状态转换矩阵的方法表示出确定化、最小化后的自动机。-1. Automatic machine to the way state transition matrix be represented inside the computer 2. According to the method of determining NFA, the NFA Det
Cellular-Automaton
- 元胞自动机的C程序，大概请问年度模拟到3.5以后，磁性开始稳定-Cellular automata C program
ACBM
- acbm算法简介，在有限自动机的多模式匹配算法(DFSA算法)的基础上, 在算法中以连续跳跃的思想,给出了另一个更加有效的改进-About acbm algorithm, finite automaton in the multi-pattern matching algorithms (DFSA algorithm), based on a continuous jump in the algorithm to the idea, given the other more effective
AjaxParser
- 一个VC++有穷自动机分析内核的源代码，为 DocWizard 做词法分析准备，本分析内核可以在不改变代码的情况下分析不同的 DFA……有意思吧，看看代码就会明白。 -VC++ there is a finite automaton of the kernel source code, to prepare for the DocWizard do lexical analysis, this analysis does not change the kernel code can anal
demo
- VC++从正则表达式到有穷自动机实例,很不错的demo-VC++ from the regular expression to finite automaton instance
FSM
- 功能强大的汇编语言词法分析器，可以读入一行汇编语言，再输出扫描结果。使用汇编语言开发，有限自动机原理。-Powerful assembly language lexical analyzer, can be read into the line of assembly language, and then export the scan results. Assembly language development, finite automaton.
dfa
- 译原理实验（确定有穷状态自动机） 输入正则文法 输出状态集合 字母表 开始状态终止状态 以及识别句子 -Translation of principle experiment (be sure to have poor state automaton) Input regular grammar output state set alphabet began to state and to identify terminate state sentences