[英]DFA to RE conversion but what if init and final state same?
我想不出我该如何解决这个问题。 你们能帮帮我吗?
You can transform this DFA into an equivalent NFA by adding in a new start state that ε-transitions into the old start state, then adding a new accepting state with an ε-transition from the old accepting state. 这样,您不必处理开始和接受状态相同的情况,并且这样做您没有更改自动机的语言。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.