Writing regular expressions describing languages of strings.

Write a regular expression describing the language of strings that have at least two 1's. The language consists of 0's and 1's.

© SolutionLibrary Inc. solutionlibary.com 9836dcf9d7 https://solutionlibrary.com/computer-science/software-development/writing-regular-expressions-describing-languages-of-strings-2h0

Solution Preview

...ng:

(0|1)*11(0|1)*

This would give us strings like 001100, but would not allow 01010. We can change it slightly to give us what we are ...