我在纸上写了一个DFA,并希望将其翻译成一组正则表达式.有人知道这样做的好工具吗？
解决方法
从我的小谷歌搜索,我找到了
JFLAP.他们还有一个关于
how to Convert FA to regular expression的教程.
JFLAP
JFLAP is software for experimenting with formal languages topics including nondeterministic finite automata,nondeterministic pushdown automata,multi-tape Turing machines,several types of grammars,parsing,and L-systems. In addition to constructing and testing examples for these,JFLAP allows one to experiment with construction proofs from one form to another,such as converting an NFA to a DFA to a minimal state DFA to a regular expression or regular grammar. Click here for more information on what one can do with JFLAP.
