retagged by
528 views
1 votes
1 votes

Let $\Sigma  = \{0, 1\}$. Let $A, \: B$ be arbitrary subsets of $\Sigma^\ast$. We define the following operations on such sets:

  • $ A+B :=  \{ w \in \Sigma^\ast \mid w \in A \text{ or } w \in B \}$
  • $A \cdot B  :=  \{ uv \in \Sigma^\ast \mid u \in A \text{ and } v \in B \} $
  • $ 2A  :=  \{ ww \in \Sigma^\ast \mid w \in A \}$


Is it true that $(A+B) \cdot (A+B) = A \cdot A + B \cdot B +2(A \cdot B)$ for all choices of $A$ and $B$? If yes, give a proof. If not, provide suitable $A$ and $B$ for which this equation fails.

retagged by

2 Answers

0 votes
0 votes

@soujanyareddy13 , Saw your answer. Coud you please ellaborate on that a little more ?

Can’t we treat this problem like digital logic ?

(A+B)(A+B) = ( A or B ) and ( A or B ) = A or B = A + B. – LHS.

For RHS : X.X = X and X.Y = 0 ( if X != Y ) --(1) ---- for this case LHS = RHS – the eqn will be true.

                                           = XY ( if X = Y ) --(2). --- for this case eqn is false – suitable counter example.

Thus in general the eqn does not hold.

Related questions

0 votes
0 votes
3 answers
2
go_editor asked Dec 30, 2016
501 views
For a string $x=a_0a_1 \ldots a_{n-1}$ over the alphabet $\{0, 1, 2\}$, define $val(x)$ to be the value of $x$ interpreted as a ternary number, where $a_0$ is the most si...
1 votes
1 votes
2 answers
3
go_editor asked Dec 31, 2016
526 views
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
1 votes
1 votes
1 answer
4