搜索资源列表
bianyiyuanli
- 编译原理有穷自动机与确定化的源代码与文档-Finite Automata and identify of
MyProjects
- 用c++加编译知识实现，一个正规式。而且是用Case语句加循环实现的。能识别一些有限自动机。-C++ compiler with the increase of knowledge achieved, a formal style. But also increases with the Case statement cycle achievable. Able to identify a number of finite automata.
comp1
- 用c++加编译知识实现，一个正规式。而且是用Case语句加循环实现的。能识别一些有限自动机。用c++加编译知识实现，一个正规式。而且是用Case语句加循环实现的。能识别一些有限自动机。-C++ compiler with the increase of knowledge achieved, a formal style. But also increases with the Case statement cycle achievable. Able to identify a number
regularexpressiontodfs
- 从正则表达式到有穷自动机实例的源代码。希望有用。-From regular expressions to finite automata examples of source code. Want to be useful.
NFA_To_DFA
- This Program will convert the Non-Deterministic Finite Automata to Deterministic Finite Automata. Here RE is not given but NFA-Table should be given to the Input And output will FA-Table. So best of luck-This Program will convert the Non-De
DFA
- 从正则表达式到有穷自动机实例，最近刚学了编译原理 搞出来得这个东西-From regular expressions to finite automata instance, recently learned more this thing come up with compiler theory
NFA12
- NON diterministic finite automata to dfa
DFA
- deterministic 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
NTD
- 在编译原理课程中的非确定有限自动机转换为确定有限自动机的源程序代码-The determinate finite automata converted to determinate finite automata
machine
- 有限自动机问题。给你的模型。让你判断是否通过-Finite automata problem. To your model. Allows you to determine whether the pass. .
10803070102_daiyongchuan
- 其中包括词法分析器和语法分析器，还包括预测分析法以及正规式转换为不确定的有穷自动机、 不确定的有穷自动机转换为确定的有穷自动机- Including the lexical analyzer and parser, but also forecast analysis and formal style uncertainty into finite automata, finite automata uncertainty into a deterministic finite aut
hronou
- 基于矩阵模型表示的_线性_有限自动机的同步序列判定-Based on linear matrix model representation _ _ synchronous finite automata to determine the sequence
elation
- 模糊乘积有限自动机的覆盖关系Product of finite automata fuzzy covering relations-Product of finite automata fuzzy covering relations
sas
- 由单个状态生成的有限自动机的一些性质.Single state generated by finite automata and some properties -Single state generated by finite automata and some properties