搜索结果

找到约 59 项符合 Epsilon-NFA 的查询结果

编译器/解释器 输入一个正则表达式

输入一个正则表达式,可以使用: 小写字母或数字,表示终结符;*,闭包;+,并集;~,补集;E,空串;O,空集 然后程序将生成 相应的NFA,以及化简之后的DFA,最后再输入一个字符串,程序判断它是否满足该正则表达式
https://www.eeworm.com/dl/628/120556.html
下载: 183
查看: 1082

人工智能/神经网络 Libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It c

Libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It can solve C-SVM classification, nu-SVM classification, one-class-SVM, epsilon-SVM regression, and nu-SVM regression. It also provides an automatic model selection tool for C-SVM classification. This doc ...
https://www.eeworm.com/dl/650/145300.html
下载: 65
查看: 1067

编译器/解释器 编译原理课程设计详细文档

编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。
https://www.eeworm.com/dl/628/221312.html
下载: 41
查看: 1025

人工智能/神经网络 k中心点 编制和调试一个程序

k中心点 编制和调试一个程序,它将用户输入的正规式转换为以状态图和矩阵形式表示的确定有穷自动机。 1.把正规式转换为NFA 2.将NFA确定化为DFA &#8226 #作为正规式的终止符 &#8226 考虑复合正规式 &#8226 开始状态号为0
https://www.eeworm.com/dl/650/233137.html
下载: 165
查看: 1034

编译器/解释器 识别正规式

识别正规式,将其转化为nfa,然后转化为dfa
https://www.eeworm.com/dl/628/238195.html
下载: 36
查看: 1092

其他 这是一个编译原理中的一个技术

这是一个编译原理中的一个技术,将已有的nfa转换为dfa的程序
https://www.eeworm.com/dl/534/267663.html
下载: 101
查看: 1045

编译器/解释器 编译课程设计

编译课程设计,有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化
https://www.eeworm.com/dl/628/270786.html
下载: 34
查看: 1018

人工智能/神经网络 libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It s

libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It solves C-SVM classification, nu-SVM classification, one-class-SVM, epsilon-SVM regression, and nu-SVM regression. It also provides an automatic model selection tool for C-SVM classification. This docume ...
https://www.eeworm.com/dl/650/315866.html
下载: 186
查看: 1041

GPS编程 function [U,V,num_it]=fcm(U0,X) % MATLAB (Version 4.1) Source Code (Routine fcm was written by R

function [U,V,num_it]=fcm(U0,X) % MATLAB (Version 4.1) Source Code (Routine fcm was written by Richard J. % Hathaway on June 21, 1994.) The fuzzification constant % m = 2, and the stopping criterion for successive partitions is epsilon =??????. %*******Modified 9/15/04 to have epsilon = ...
https://www.eeworm.com/dl/693/377007.html
下载: 125
查看: 1134

编译器/解释器 扫描样本字符串

扫描样本字符串,转换成NFA,继续转换,成为DFA,验证此字符串。
https://www.eeworm.com/dl/628/386479.html
下载: 55
查看: 1019