Let L(R) be the language denoted by regular expression R.
I'd really love your help with presenting a regular expression to the complement
of L((0 U 10 U 110)* (epsilon U 1 U 11)), where language is over the alphabet {0,1}, epsilon is the empty word, 'U' stands for union and '*' is the star iterator.
I tried to find it with De Morgan's laws. I think that I am requested to evaluate
not (L((0 U 10 U 110)* (epsilon U 1 U 11)))- what is not of the '*' for example?
Thanks a lot
您需要将正则表达式转换为确定性有限自动机,对它进行补充(在另一个DFA中),然后将其转换回正则表达式。
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.