文章基本信息

标题：Converting an NFA to a DFA with programming C++
本地全文：下载
作者：M. Davoudi-Monfared ; R. shafiezadehgarousi ; E. S. Haghi 等
期刊名称：International Journal of Advanced Computer Research
印刷版ISSN：2249-7277
电子版ISSN：2277-7970
出版年度：2015
卷号：5
期号：21
页码：355-366
出版社：Association of Computer Communication Education for National Triumph (ACCENT)
摘要：In Automata Theory, if a language is recognized bay a Non-deterministic finite automaton (NFA), then we must show the existence of deterministic finite automaton (DFA) that also recognizes it. There are many idea and algorithms to convert an NFA in to an equivalent DFA that simulates the NFA. In this paper, we present an algorithm to convert an NFA to a DFA with programming by C++. This approach contains several classes and is so universal that cover converting from NFA to DFA completely.
关键词：Automata; Convert; NFA; DFA; C++