搜索资源列表
FAv1
- 使用C＃编写，实现输入正则表达式，输出确定有限自动机，使用图形界面显示。-prepared to use C#, are realizing the importation of expression, to determine output finite automata, the use of a graphical interface shows.
6611333
- 有穷自动机的转换大家可以参考下谢谢了下了袄-Finite Automata we can change the reference Thank you, the next under a coat
ashfuafnasjf
- 简单的词法分析程序 1)通过理解正规式、有限自动机原理，根据下面的X语言的说明编制一个X语言的词法分析程序。 (2)提交实验报告，报告内容如下： 目的要求、DFA、程序清单（带注释）、测试样例及结果-simple lexical analysis procedure 1) understanding through informal style, Finite Automata Theory, according to the following X-language statement pre
77433631694.rar
- 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西。 有限自动机的确定华，NFA到DFA的转变。 ,Is the type that the DFA has recently learned a compiler to produce more of the principle of things. Determination of finite automata China, NFA to DFA transformation.
acsmx
- AC算法----有限自动机的多模式匹配算法.该算法应用有限自动机巧妙地将字符比较转化为了状态转移。-AC algorithms finite automata---- Multi-pattern matching algorithm. The algorithm uses finite automata skilfully converted to state transition character comparison.
youxian
- 利用状态表和有限自动机的运行原理编制程序，使得程序能够识别一个输入串是否为一个有效的符号串。-The use of state tables and finite automata operating principle of the preparation process, making the procedure to identify whether an input string for an effective symbol string.
1
- 第一部分为有限自动机的构造，第二部分为自动机的比较。-The first part of the structure of finite automata, the second part of the comparison automaton.
Finite_Automata
- 介绍有限自动机原理的PPT，制作精良，推荐阅读-a PPT about Finite Automata
3c4f17957854
- 正则式到dfa的转化 正规式到有穷自动机的转化-Regular expression to dfa conversion of regular expression to the transformation of finite automata
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.
youqiongzidongjideshixian
- 无符号有穷自动机的实现！~编译原理实验！~-Unsigned Realization of finite automata! ~ Compilation Principle Experiment
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
Finite-state-automata-Uncomment
- 关于使用有限状态自动机将程序的注释去除（不含print中的注释~）-Remove program notes on the use of finite state automata (excluding print the comments in the ~)
DFAminimization
- A program that minimizes a deterministic finite automata
automata
- 自动机（用于识别输入字符串是否合乎规则，否则报错）-finite automata
automata
- 有限自动机的确定华,NFA到DFA的转变,很好的源码(The determination of finite automata China, NFA to DFA transformation, a good source)
Mazharul String Matching By Finite Automata
- Mazharul String Matching By Finite Automata