搜索资源列表
Dijkstra_c
- C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre
redundantpaths
- c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u
050420106
- 自动机的确定化和最小化,是我自己写的文档哈，感谢大家下载-the deterministic and minimum of automaton
cifafenxi
- 求n！的最小语言，编译器词法分析功能-For n! The minimum language, compiler lexical analysis function! !
LexicalAnalyzer
- 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。 将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually constr
DFAMinimize
- 编译原理中的DFA最小化实现方法，用C语言实现-DFA Compilation Principle of minimum realization method, using C language
minimumDFA
- 编译原理文法C语言编程实现DFA的最小化-C programming language grammar compiler theory to achieve the minimum DFA
C8051F120-Schematic
- C8051单片机的一个最小系统版，我买的一款，资料还行，需要可以在找我-A minimum system version of the C8051 MCU, I bought a data line, needs can be in me.
NFA_to_DFA
- 按照输入提示输入一个NFA，可以得到一个最小的DFA-After entering an NFA with the input instruction,a minimum DFA can be figured out.