Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - nfa
Search - nfa - List
在非确定的有限自动机NFA中,由于某些状态的转移需从若干个可能的后续状态中进行选择,故一个NFA对符号串的识别就必然是一个试探的过程。这种不确定性给识别过程带来的反复,无疑会影响到FA的工作效率,所以我们有必要将NFA确定化。
Date : 2008-10-13 Size : 78.45kb User : 陈成

遗传算法与工程设计-玄光男,程润伟著-电子书pdf格式-Genetic Algorithms and Engineering Design-Yuen-man, Guilin-to-pdf format e-books
Date : 2026-01-01 Size : 6.5mb User : 290227403

在非确定的有限自动机NFA中,由于某些状态的转移需从若干个可能的后续状态中进行选择,故一个NFA对符号串的识别就必然是一个试探的过程。这种不确定性给识别过程带来的反复,无疑会影响到FA的工作效率,所以我们有必要将NFA确定化。-In the non-deterministic finite automaton of the NFA, because of the transfer of certain state to be from a number of possible follow-up to the state to choose, so a NFA identification string of symbols must be on a trial process. This uncertainty to the recognition process brought about by repeated, it will undoubtedly affect the efficiency of the FA, so we need to determine of NFA.
Date : 2026-01-01 Size : 78kb User : 陈成

NFA的确定化是编译过程中一个重要的部分,由于本程序的输入很多,而且有多种格式的输入,所以输入时必须非常小心细致。本程序比较复杂,需要使用多个结构体并使用了指针。必须将程序分解为多个子程序以降低编写难度。想起了软工老师的一句话:"难事破与易",再复杂的事,拆成一个个简单的小部分,逐个击破,在拼凑起来,复杂的事也变的简单了。适当使用全局常量可以控制有效控制内存溢出。由于程序较大,调试时多人协作能更容易易找出程序并成功修改。-NFA determination is the process of compiling an important part, due to the importation of many of the procedures, but also a variety of formats input, so input must be very careful and meticulous. This procedure is rather complicated, the need to use multiple structures and use the pointer. Procedures must be decomposed into a number of subroutines to reduce the difficulty of preparation. Soft workers thought of the teacher s words: difficult to break and easy , and then a complex issue, is split into a small portion of a simple, one by one break in together, things have changed the complexity of the simple. Proper use of global constants can be controlled effectively control memory overflow. Because of the larger process, debugging collaboration when people can easily find out the procedure more easily and successfully modified.
Date : 2026-01-01 Size : 146kb User : 佚星

消除文法的左递归,实现文法的化简以及NFA与DFA的转换-Elimination of left recursive grammar to achieve grammatical simplification, as well as conversion of NFA and DFA
Date : 2026-01-01 Size : 42kb User : yao

关于编译器的词法分析过程,输入正则表达式输出NFA-Compiler, lexical analysis process, enter the regular expression output NFA
Date : 2026-01-01 Size : 311kb User : benben

设计题目:把NFA确定化为DFA 的算法实现 设计内容及要求:构造一程序,实现:将给定的NFA M(其状态转换矩阵及初态、终态信息保存在指定文件中),确定化为DFA M’。(要先实现ε-CLOSURE函数和Ia函数)。输出DFA M’(其状态转换矩阵及初态、终态信息保存在指定文件中)。 -Design: the NFA into a DFA algorithm to determine the content and requirements of the design: structure a program to achieve: the given NFA M (its state transition matrix and the initial state, the final state information is saved in the specified file), determination of the the DFA M ' . (First to achieve ε-CLOSURE functions and Ia function). Output DFA M ' (its state transition matrix and the initial state, the final state information is saved in the specified file).
Date : 2026-01-01 Size : 109kb User : DZ

NFA转化成DFA的课程实验,包括完整的实验理论知识,实验结果以及实验分析-The course experiment of NFA covert to DFA , including the complete experimental theoretical knowledge, experimental analysis and experimental results
Date : 2026-01-01 Size : 60kb User : dff

本代码是用VC把NFA正规式转成DFA,希望对大家有帮助。-This code is used to NFA regular formula VC turn into DFA, I want to help.
Date : 2026-01-01 Size : 3kb User : 刘行

NFA machine to DFA machine
Date : 2026-01-01 Size : 2kb User : kollv
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.