Assignment 1 （private article for Theory of Computation homework1）

Assignment 1

author： tim5wang@qq.com

---

Answer:
a. let $DFA:M_1$={$w|w$ has at least tree a’s}

$andDFA:M_2$={$w|w$ has at least two b’s}

$\Rightarrow DFA:M=M_1\cap M_2$

---

b. let $M_1$ = {$w|w$ has exactly two a’s}

$M_2$ = {$w|w$ has at least two b’s}

$\Rightarrow M=M_1\cap M_2$

c. let $M_1$ = {$w|w$ has even number of a’s}

$M_2$ = {$w|w$ has one or two number of b’s }

$\Rightarrow M=M_1\cap M_2$

d. let $M_1$ = {$w|w$ has even number of a’s}

$M_2$ = {$w|w$ has each a is followed by at least one b}

$\Rightarrow M=M_1\cap M_2$

but if input abb*a, it can accept , so add a state, the final result is:

e. let $M_1$ = {$w|w$ has starts with an a}

$M_2$ = {$w|w$ has at most one b}

$\Rightarrow M=M_1\cap M_2$

f. let $M_1$ = {$w|w$ has an odd number of a’s}

$M_2$ = {$w|w$ ends with a b}

$\Rightarrow M=M_1\cap M_2$

g. let $M_1$ = {$w|w$ has even lenght}

$M_2$ = {$w|w$ has an odd number of a’s}

$\Rightarrow M=M_1\cap M_2$


Answer:
Theorem 1.39 said that every nondeterministic finite automaton has an equivalent deterministic finite automaton.
(a) Let $N=(Q,\sum ,\delta ,q_0,F)=$ ({1,2} , {a,b}, $\delta$, 1, {1}) be the NFA recognizing language A. $M=(Q^{\prime },\sum ,{\delta }^{\prime },q_0^{\prime },F^{\prime })$ is a DFA need constructed that recognizing A.
step 1. $Q^{\prime }=P(Q)=$ {$\varnothing$, {1}, {2}, {1, 2}}
step 2. For $R\in Q^{\prime }$ and $s\in \sum$, let ${\delta }^{\prime }(R,s)={\bigcup }_{r\in R}\delta (r,s)$, exactly , ${\delta }^{\prime }$ can be represented as:

	a	b
1	{1, 2}	{2}
2	$\varnothing$	{1}

step 3. q 0 ′ = { q 0 } = { 1 } q'_0=\{q_0\}=\{1\} q0′​={q0​}={1}
step 4. $F^{\prime }=${{1, 2}, {1}}
step 5.

(b)
step 1. Let NFA $N=(Q,\sum ,\delta ,q_0,F)=$ ({1, 2, 3} , {a, b}, $\delta$, 1, {2}) ,
DFA $M=(Q^{\prime },\sum ,{\delta }^{\prime },q_0^{\prime },F^{\prime })$
step 2. ${\delta }^{\prime }$:

	a	b	$\epsilon$
1	{3}	$\varnothing$	{2}
2	{1}	$\varnothing$	$\varnothing$
3	{2}	{2, 3}	$\varnothing$

$\Rightarrow$

	a	b
1	{1, 3}	$\varnothing$
2	{1, 2}	$\varnothing$
3	{2}	{2, 3}

step 3. q 0 ′ = { q 0 } = { 1 , 2 } q'_0=\{q_0\}=\{1, 2\} q0′​={q0​}={1,2}
step 4. $F^{\prime }=${{2}, {1, 2}, {2, 3},{1, 2, 3}}
step 5.

Answer:
(a):

the regular expression is $(a^{\ast }b{a}^{\ast }b{)}^{\ast }{a}^{\ast }b{a}^{\ast }$
(b):

The regular expression is $((a\cup b)a^{\ast }(bb{)}^{\ast }(b\cup bb){)}^{\ast }$

Answer:
a. $T_1$ on input 011, the sequence of states is $q_1{q}_1{q}_1{q}_1$, the output string is 000.
b. $T_1$ on input 211, the sequence of states is $q_1{q}_2{q}_2{q}_2$, the output string is 111.
c. $T_1$ on input 121, the sequence of states is $q_1{q}_1{q}_2{q}_2$, the output string is 011.
d. $T_1$ on input 0202, the sequence of states is $q_1{q}_1{q}_2{q}_1{q}_2$, the output string is 0101.
e. $T_2$ on input b, the sequence of states is $q_1{q}_3$, the output string is 1.
f. $T_2$ on input bbab, the sequence of states is $q_1{q}_3{q}_2{q}_3{q}_2$, the output string is 1111.
g. $T_2$ on input bbbbbb, the sequence of states is $q_1{q}_3{q}_2{q}_1{q}_3{q}_2{q}_1$, the output is 110110.
h. $T_2$ on input $\epsilon$ has no change of state, has no output.

Answer:
a. $a(abb{)}^{\ast }\cup b$

because the number (abb) can be 0, so the final result is shown below:

b. $a^{+}\cup (ab{)}^{+}$

c. $(a\cup b^{+})a^{+}{b}^{+}$

---

转载请注名出处： tim5wang的博客 ：
https://blog.csdn.net/sinat_34820292/article/details/82904416