15,140 views
46 46 votes

Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for strings

  1. does not form a group
  2. forms a non-commutative group
  3. does not have a right identity element
  4. forms a group if the empty string is removed from $\Sigma^*$

3 Answers

Best answer
80 80 votes
Identity element for concatenation is empty string $\epsilon$. Now, we cannot concatenate any string with a given string to get empty string $\implies$ there is no inverse for string concatenation. Only other 3 group properties -- closure, associative and existence of identity -- are satisfied.

Hence, ans should be (a).
• edited by
22 22 votes

 

Closure? Yes.

Concatenate any string in $Σ^∗$ with a string $Σ^∗$, you get a string in $Σ^∗$.


Associativity? Yes.

Example: $a.(b.c)=(a.b).c=abc$

No counter example can be found.


Identity? Yes. The null string $\epsilon$

$x.\epsilon=x$


Inverse?

10110 concatenated with what gives null string? There can't be an inverse here.

If you think 10110.$\phi$ would work, then no.

$x.\phi=\phi$

  • $\epsilon$ = null string.
  • $\phi$ = null set.
  • $\phi\neq\epsilon$

Here, inverse doesn't exist for any element except identity element.

So, this is a monoid.

 

Option A

0 0 votes
1) closure exists take any string from Σ* do concatenation with anyother strong you will remain in same set of Σ*
2)associativity exists as strong concatenation is associative
3)indentity exist : a * e = e * a = a
                            here e can be epsilon
                            (any string ) . epsilon = epsilon . (any string )= (same string)
4) inverse : definition of inverse says it should exist for all element belonging to the given set but it only exists for ε.

therefore it does not form a group
option a) says it does not form a group. ✓
option b) it says forms non commutative group a commutative group is abelian group it says non commutative group means a group which is non abelian yes it does not satisfy commutativity but it is not even a group ❌
option c) does not have a right identity element ❌
              infact both right and left identity exists
option d) forms a group if the empty string is removed from Σ* ❌
infact we won't even satisfy identity here as epsilon is removed no therefore inverse still won't exists.
if we only have epsilon as an element then it forms a group .
Answer:
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
14.8k
14.8k views
Kathleen asked Sep 17, 2014
14,757 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
58 58 votes
12 answers 12 answers
13.8k
13.8k views
Kathleen asked Sep 17, 2014
13,848 views
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c...
82 82 votes
8 answers 8 answers
21.1k
21.1k views
Kathleen asked Sep 16, 2014
21,052 views
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S \(\to\) {True, False} be a predicate defined on S. Suppose that P(...
71 71 votes
9 answers 9 answers
15.3k
15.3k views
Kathleen asked Sep 17, 2014
15,333 views
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows:$g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$.Let $p_i$ denote t...