NFA的正则表达式 [英] regular expressions to nfa

问题描述

我需要将以下正则表达式转换为NFA.
一世. (1 + 0)*(1 + 0)(1 + 0)(1 + 0)*
ii. (0 + *)1 *(* + 0)
iii. (10 * 10 * 10 *)+ 0 *

唯一的问题是我无法理解正则表达式的含义...任何人都可以帮助我或做一个过渡表，然后从那里开始工作吗?谢谢

hi i need to Convert the following regular expressions to NFAs.
i. (1+0)*(1+0)(1+0)(1+0)*
ii. (0+*)1*(*+0)
iii. (10*10*10*) + 0*

only problem is i cant understand what the regular expression mean... can anyone help me or do a transition table and ill work it out from there ?? thanks

推荐答案

如果您需要了解正则表达式，请获取 Expresso [ ^ ]-它是免费的，并检查，解释并生成正则表达式.

If you need to understand a Regex, get a copy of Expresso [^] - it''s free, and it examines, explains and generates Regular expressions.

这篇关于NFA的正则表达式的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！