搜索资源列表
有穷自动机识别无符号数
- 有穷自动机识别源码- Has the poor automaton recognition source code
确定有穷自动机
- 用vb编写的编译器 用以实现确定有穷自动机中状态对的转换-with vb prepared by the compiler to achieve identified the poor state of automatic machines for the conversion
确定型有穷自动机接受的语言的判定
- 用vc 实现的计算理论的基本程序，该程序能判定一个输入的语言能否被有台确定型有穷自动机所接受。-vc used to achieve the theoretical calculation of the basic procedures, the program can determine an input language can be identified with Taiwan-based Finite Automata acce
正则式到有穷自动机
- 学习离散数学时在老师地要求下编写的个小程序，正则式到有穷自动机 -discrete mathematics learning at the request of the teacher to prepare the small procedure is to then - DFA
正则式到有穷自动机
- 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西-to DFA has recently compiled a study of the principles of producing more things
有穷自动机识别无符号数
- 有穷自动机识别源码- Has the poor automaton recognition source code
确定有穷自动机
- 用vb编写的编译器 用以实现确定有穷自动机中状态对的转换-with vb prepared by the compiler to achieve identified the poor state of automatic machines for the conversion
确定型有穷自动机接受的语言的判定
- 用vc 实现的计算理论的基本程序，该程序能判定一个输入的语言能否被有台确定型有穷自动机所接受。-vc used to achieve the theoretical calculation of the basic procedures, the program can determine an input language can be identified with Taiwan-based Finite Automata acce
有穷自动机
- 自己编的一个判断浮点数的有限自动机，大家来看看啊-own series of the float of a judge finite automata, we arrives
正则式到有穷自动机
- 学习离散数学时在老师地要求下编写的个小程序，正则式到有穷自动机 -discrete mathematics learning at the request of the teacher to prepare the small procedure is to then- DFA
0024
- 正则式到有穷自动机，c++源代码，请大家多提宝贵意见，-to DFA, c source code, please provide more valuable advice, thank you
正则式到有穷自动机
- 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西-to DFA has recently compiled a study of the principles of producing more things
DFAv1
- 关于有穷自动机和正则表达式相互转化的程序，并完成有穷自动机的确定化和最小化。-on Finite Automata and Regular expressions are transformed into each other procedures, and complete the DFA and the determination of the smallest.
DFAjuti
- 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西-to DFA has recently compiled a study of the principles of producing more things
LexicalAnalyser
- java版本的词法分析器，有穷自动机根据大型编译系统的模式构造。-java version of the lexical analyzer, the DFA Compilation System under the large tectonic model.
69446611333
- 正则式到有穷自动机 基本上可以满足你的要求-to DFA basically satisfy your request
zhenguishidaoyouqiongzidongji
- 该C++源码为正规式到有穷自动机的转化过程的实现-C source code for the formal ceremony to DFA's transformation process to achieve
KModies
- k中心点 编制和调试一个程序，它将用户输入的正规式转换为以状态图和矩阵形式表示的确定有穷自动机。 1．把正规式转换为NFA 2．将NFA确定化为DFA • ＃作为正规式的终止符 • 考虑复合正规式 • 开始状态号为0 -focal point for the preparation of k and debug a program, it will the user to ent
DFA
- 正则表达式到有穷自动机。 “DFAScan”的改进版本。 编译原理实验代码之一。-Regular Expressions to DFA. DFAScan Improved version. Principle experiment, one of the compiler code.
NFtoDFA
- 正则表达式转换为有穷自动机的算法，用c语言编写的。-Regular expression is converted to DFA algorithm, using c language.