Solution :
We have to provide an expression for the binary numbers. There can be binary fractions or integers. Whenever there is leading 0, it is not allowed unless the integer part is a 0.
Thus the expression is :
[tex]$(-+ \in )$[/tex] [tex]$[(1+10+11+100+101+110+111)(,000+,001+,010+,011+,111+,100+,101+,110)^*$[/tex] [tex]$(\in +.(0+1)^*(0+1))+(0.(0+1)^*(0+1))]$[/tex]
In this exercise we have to have knowledge about binary code to calculate with these numbers, so we have:
[tex](E+(0+1)*(0+1))[/tex]
A binary code represents text, computer processor instructions, or any other data using a two-symbol system. The two-symbol system used is often "0" and "1" from the binary number system.
Knowing this now we can perform the calculations like:
[tex](1+10+11+100+101+110+111)(000+001+010+011+111+100+101+110)\\(E+(0+1)*(0+1))[/tex]
See more about binary code at brainly.com/question/7960132
