什么是麦克诺顿，山田算法？ [英] what is the McNaughton-Yamada Algorithm?

问题描述

我需要使用麦克诺顿 - 山田算法的CS类构造一个DFA。问题是，该算法是补充材料，我不清楚它究竟是什么。它是查找DFA给定的正则表达式或者是找到DFA再加上它最小化的方法？我似乎无法找到关于这个问题的任何信息。

I am needing to construct a DFA using the McNaughton-Yamada algorithm for a CS class. The problem is the algorithm is supplemental material and I am not clear on what it is exactly. Is it a method for finding a DFA given a RegEx or is finding the DFA plus minimizing it? I can't seem to find any info on the subject.

我很困惑，因为最小化程序我的老师表现后，我们发现了DFA在课堂上似乎没有什么不同比'标记'最小化在我们的书。

I am confused because the minimization routine my instructor showed after we found the DFA in class doesn't seem any different than the 'mark' minimization described in our book.

感谢您的回复，

森

推荐答案

...的麦克诺顿，山田分析算法，即定期EX pression发现描述了由一个有限状态机的转换表接受的话给出。未修改的算法将产生4N术语重新presenting的n状态机，这个数字可以通过消除重复的计算和拒绝奥纳高电平前$ P对应于没有可能的路径在相同的状态图$ pssions减少，余下的前pressions present一个严重的简化问题，因为空EX pressions和空字宽松的算法产生的。

"...the McNaughton-Yamada analysis algorithm, whereby a regular expression is found describing the words accepted by a finite state machine whose transition table is given. Unmodified the algorithm will produce 4n terms representing an n-state machine. This number could be reduced by eliminating duplicate calculations and rejecting ona high level expressions corresponding to no possible path in the same state diagram. The remaining expressions present a serious simplification problem, since empty expressions and null words are generated liberally by the algorithm."

来源

这篇关于什么是麦克诺顿，山田算法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！