简体繁体中英

Is the language 0^m.0^n , 0<=m<=n regular?

原文 2017-11-11 05:27:43 6 1 regex/ regular-language/ finite-automata/ computation-theory

0^m.0^n, . represents concatenation , ^ represents power.

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.

While I know that is wrong, I still need to confirm. Thanks

1 answers

Your friends are right, this is regular. With 0<=m you can set m=0. Now for any string 0^k you set k=n. So indeed all strings from 0^* fulfill this condition, and they forma regular language.

why a^m b^n where m,n > 0 is a regular language but a^n b^n where n > 0 is non regular language

regular expression to replace ^M with \n or to remove ^M

Javascript, regular expression and {n,m}

Does Awk support regular expression quantifiers \{m,n\} or \{m\} or \{m,\}?

Why is this regular expression not working ({m, n})?

Regular expression for permutation of M characters of length N

Regular Expression matching at least n of m groups

L={a^nb^m| n+m=k ,n,m>=0} with Regular Expression in C#

Regular Expression: {n} and {n,m} ignore maximum number of repetition

Regular Expression form {m,n} does not use upper limit

暂无

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.

Related Question why a^m b^n where m,n > 0 is a regular language but a^n b^n where n > 0 is non regular language regular expression to replace ^M with \n or to remove ^M Javascript, regular expression and {n,m} Does Awk support regular expression quantifiers \{m,n\} or \{m\} or \{m,\}? Why is this regular expression not working ({m, n})? Regular expression for permutation of M characters of length N Regular Expression matching at least n of m groups L={a^nb^m| n+m=k ,n,m>=0} with Regular Expression in C# Regular Expression: {n} and {n,m} ignore maximum number of repetition Regular Expression form {m,n} does not use upper limit

Related Tags

Is the language 0^m.0^n , 0<=m<=n regular?

Question

1 answers

solution1 0 2017-11-11 15:07:35

solution1
0 2017-11-11 15:07:35