I'm having trouble figuring out a regular expression over the alphabet {0,1} that contains all strings with no TWO consecutive 1's.
I'm also wondering if there is a pattern that could be extended to three consecutive 1s. etc...
Would something like this be correct?
(0 U (10))* U (0 U (10))* 1
