自动机理论中的正则表达式？
[英]Regular expression in Automata Theory?
问题描述
I have the following language and its regular expression 
我有以下语言及其正则表达式
{w ∈ {a, b}* : w has bab as a prefix, and babaa as a suffix} {w∈{a，b} *：w以bab为前缀，而babaa为后缀}
Answer: 回答：
Regular expression = bab(a ∪ b)*babaa ∪ babaa ∪ bababaa 正则表达式= bab（a∪b）* babaa∪babaa∪bababaa
Why bold part is needed? 为什么需要大胆的部分？
1 个解决方案
解决方案1
1 已采纳 2017-05-24 01:37:40
bab is a prefix of babaa, and babaa is obviously a suffix of itself. bab是babaa的前缀，而babaa显然是其后缀。 Therefore, babaa is a possible string. 因此，babaa是可能的字符串。
babaa is a suffix of bababaa and bab is a prefix of bababaa. babaa是bababaa的后缀，而bab是bababaa的前缀。 Thus, it should also be included. 因此，它也应包括在内。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.