3,612 views
0 0 votes
Let L1= 10* and  L2=101*  

Find  L1 Union L2 , L1 intersection L2 , L1 - L2  in the form of regular expressions.

2 Answers

Best answer
7 7 votes
$L_{1} = 10^{*}$ $= {1,10,100,1000,...}$

$L_{2} = 101^{*}$ $= {10,101,1011,10111...}$

$1) L_{1} \cup L_{2} = 10^{*} + 101^{*} = 1(0^{*}+01^{*})$

$2) L_{1} \cap L_{2} = $ $\left \{ 10 \right \}$

$3) L_{1} - L_{2} = L_{1} - \left ( L_{1} \cap L_{2}\right )$ $= L_{1} - \left \{ 10 \right \}$ $= \left ( 10^{*} \right ) -$ $\left \{ 10 \right \}$
• selected by
0 0 votes
$L1 \bigcup L2$ = 10* + 101* I dont think think further simplification is possible in this case.

$L1 \bigcap L2$ = 10

L1 - L2 = 10* - 10
• edited by
Position:
Show:

Related questions

1 1 vote
1 1 answer
82
82 views
GO Classes asked Oct 1
82 views
Consider the following regular expressions over the alphabet$\Sigma=\{a,b\}$.$R_1=a(a\cup b)^*$$R_2=b(a\cup b)^*$If $L(R)$ denotes the language associated with regular ex...
0 0 votes
1 1 answer
405
405 views
L_Rashmi_Dedeepya asked Nov 14, 2024
405 views
Most languages are case sensitive, so keywords can be written only one way, and the regular expressions describing their lexemes are very simple. However, some languages,...