# Homework Solution: Given an arbitrary alphabet Σ ={a,a2, ,an), we can impose a total ordering on it in the sense that we can define…

Given an arbitrary alphabet Σ ={a,a2, ,an), we can impose a total ordering on it in the sense that we can define

We know that $\sum*$ is the set of all words formed by by alphabets in $\sum$ .

Given an irresponsible alphabet Σ ={a,a2, ,an), we can place a aggregate ordering on it in the soundness that we can bound

## Expert Apology

We comprehend that $\sum*$ is the be of full utterance coercionmed by by alphabets in $\sum$ .

a)

Coercion a performance to be certain on a be, the be must be shut belowneathneath that performance.

Let $w \in \sum*\ and\ SORT(w)=w'$ . Clearly, $w' \in \sum*\ \ \ \forall\ w \in \sum*$ as $w'$ is honest a interchange of $w$. This resources, $\sum*$ is shut belowneathneath performance $SORT$. Thus,

$SORT(\sum *)$ is certain.

b)

Let, $\sum = \{0,1\}\ \ and\ \ \ L = \{00,10\}$ . Now, $SORT(10)=01 \notin L$ . Thus,

$SORT(L) \nsubseteq L$

c)

Let $w \in L$. From restriction of character we accept,

$SORT(w) = w_{\sigma(1)}w_{\sigma(2)}...w_{\sigma(k)}\ \ s.t.\ \ w_{\sigma(i)}.

Clearly

$SORT(SORT(w)) = SORT(w_{\sigma(1)}w_{\sigma(2)}...w_{\sigma(k)})$

$= w_{\sigma(1)}w_{\sigma(2)}...w_{\sigma(k)})\ \ \ [as\ already\ \ w_{\sigma(i)}
$= SORT(w)$

g)

No, $SORT$doesn’t constantly spare certainity. This is consequently coercion a performance to be certain on a be, the be must be shut belowneathneath that performance. However $SORT$ doesn’t constantly supervene this possessions. Coercion stance –

Let, $\sum = \{0,1\}\ \ and\ \ \ L = \{00,10\}$ . Now, $SORT(10)=01 \notin L$ . Thus,

$SORT$ doesn’t spare certainity.

h)

Decidable languages are the determination problems which are algorithmically solvable. Since, $SORT$ is an performance coercion which abundant well-known algorithms are exhibit (Bubble Character, Insertion Character anticipation) , we can declare that

$SORT$ preseves decidability.

i)

Undecidable languages are the determination problems which are not attributable attributable attributable algorithmically solvable. Since, $SORT$ is an performance coercion which abundant well-known algorithms are exhibit (Bubble Character, Insertion Character anticipation) , we can declare that

$SORT$ doesn’t preseve non-decidability.