状态合并的DFA感应算法约束强制合并State-merging DFA induction algorithms with mandatory merge constraints |
|
课程网址: | http://videolectures.net/icgi08_dupont_smdfa/ |
主讲教师: | Pierre Dupont |
开课单位: | 鲁汶大学 |
开课时间: | 2008-09-23 |
课程语种: | 英语 |
中文简介: | 有人声称,构建软件系统最困难的部分是确定系统应该做什么;可以通过学习场景中的行为模型来自动化部分RE过程;场景是可能的事件串,可以推广到形成一种语言可接受的行为;这些语言可以方便地用有限状态机表示。 |
课程简介: | It has been claimed that the hardest par t in building a softwaresystem is deciding precisely what the system should do;One can automate parts of this RE process by learning behaviormodels from scenarios;Scenarios are strings of possible events which can be generalizedto form a language of acceptable behaviors;Such languages are conveniently represented by finite-state machines. |
关 键 词: | 感应; 合并; 软件; RE |
课程来源: | 视频讲座网 |
最后编审: | 2020-06-27:yumf |
阅读次数: | 50 |