HW$-2(3)$

This is a correct NDFA. Pteone

explain why it is correct.

Explain why it is currect NDEA

design. This in a correc NDFA desin.

pleare explain why thin is

correct.

$(6)$ Design a NFA aver an $(10)$

alphabet ${\displaystyle \underset{?}{\overset{?}{}}}$:$\{a,b\}$ such that

every string accepted must end

with xbab.

This is correct NFA design explain why

it is correct. $(7)$ Desgn a NDFA that accepts au surings

over the alphaset $=\{a,b\}$ such that

every accepted string start and end

with different symbo. $(10)(8)$ Design a NDFA that accepts ael strings over the

alphabet ${\displaystyle \underset{?}{\overset{?}{}}}=\{a,b\}$ such that eveny $(10)$

accepted string ${}_1$ is like

$(1)=sx,$ where $s=aa\frac{a}{b}bb$

$(2)=xs,$ where $s=aa\frac{a}{b}bb$

$(3)w=xs,$ where $s=aa\frac{a}{b}bb$

$(9)$ Design a NFA that accepts are strings

ver the alphaset ${\displaystyle \underset{?}{\overset{?}{}}}=\{a,b\},$ such

that every boring I $\text{'}$ a ccepted must

be like. $(10)$

$($a$)||=3$

Answer: I will only a ccept that

string that is likely to be accepted.

Design a Non$-$Deterministic Finite

state Dntomata: $=\{0,1\}$

$(1)$ Set of all strings that

$0,1$ ends with $\{$:${11}^{\text{'}}\}(2)$

Is this correct NDFA. If it

is correct please explain

Why is it correct.

$(2)$ set of al strings that centain $\text{'}0\text{'}$