[英]Is the language 0^m.0^n , 0<=m<=n regular?
0^m.0^n, . 0 ^ m.0 ^ n,。 represents concatenation , ^ represents power.
表示串联,^表示幂。
0<=m<=n 0 <= m <= n
My friends are arguing that any string of the form 0* can be broken down conveniently to satisfy the above relation between m and n and hence this should be regular. 我的朋友争辩说,可以方便地分解任何形式为0 *的字符串以满足上述m和n之间的关系,因此这应该是规则的。
While I know that is wrong, I still need to confirm. 虽然我知道这是错误的,但我仍然需要确认。 Thanks
谢谢
Your friends are right, this is regular. 您的朋友是对的,这很正常。 With 0<=m you can set m=0.
使用0 <= m可以设置m = 0。 Now for any string 0^k you set k=n.
现在,对于任何字符串0 ^ k,您都可以设置k = n。 So indeed all strings from 0^* fulfill this condition, and they forma regular language.
因此,确实所有来自0 ^ *的字符串都满足此条件,并且它们形成了常规语言。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.