Theory of Computation

2. Write a regular expression describing each of the following languages, all over the alphabet 10,1 (a) All even numbers represented in binary. (b) The language of all strings satisfying this condition: if the string contains a 1, then it does not contain any 0's. Assignment # 3 February 20, 2019 (c) The language of all strings satisfying this condition: if the string has length exactly 2 then it does not contain any 1's. (d) Strings for which all 1's occur in pairs: that is, no 1 can be all by itself, and 111 is never a substring