Regular expression problem

57 Views Asked by At

I have this question and no clue how to solve. Thanks for your help

I need to build the regular expression matching this language $$L=\{ 0^m~1^n | (m+n) \pmod 3 = 1 \}$$

1

There are 1 best solutions below

1
On BEST ANSWER

What about this?

((000)*(111)*1) | ((000)*0(111)*) | ((000)*00(111)*11)