91影视

$NP-class:NP$is a class of languages that are decidable in nondeterministic polynomial time on a non 鈥� deterministic Turing machine.

Let $A鈥�andB$be languages are decided by $NP-$ machines $T_A$and $T_B$. Now we want to show that, there is a non 鈥� deterministic poly time decider $T_{A鈭�B}$ that decides union of $A鈥�andB$The construction of $T_{A鈭�B}$is as follows:

$T_{A鈭�B}=$On input $S$ :

1. Run $T_A$on $S$. If$T_A$ accepts$S$ , then accept.

2. Else run $T_B$on S. If accepts$S$ , then accept.

3. Else reject鈥�

As the new TM $T_{A鈭�B}$calls $T_A$and $T_B$each once, it runs on $O(T_A+T_B)$,

as both are NP is $T_{A鈭�B}$

Let $A鈥�andB$be languages are decided by$NP$machines $T_A$and $T_B$. Now we want to show that, there is a non 鈥� deterministic poly time decider$T_{A鈭�B}$ that decides concatenation of$A鈥�andB$.The construction of $T_{A掳B}$ is as follows:

$T_{A掳B}$=On input $S$:

1.$S$Split into $S_1$,$S_2$ such that $S=S_1,S_2$.

2. Run the $T_B$on$S_2$ . If${\mathit{T}}_{\mathbf{B}}$ is rejected, then reject.

3. Else accept.

Thus, $T$is a poly-time non-deterministic decider for $A^{掳}B$.