Sei sulla pagina 1di 4

Set 1

1 Convert the following NFA to its equivalent DFA


using the steps of theorem.
(a) M = ({q0, q1, q2, q3}, {0, 1}, δ, q0, {q3})
Where
δ 0 1
q0 {q0, q1} {q0}
q1 {q1} {q2}
q2 {q3} Φ
q3 {q3} {q3}

2. Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition
.follow the steps of theorem:-
(a) String contains at most two ‘b’.
(b) String whose 4th last symbol is ‘b’.

Set 2

1 Convert the following NFA to its equivalent DFA


using the steps of theorem.

(a) M = ({q0, q1, q2, q3}, {a, b}, δ, q0, {q2, q3})
Where
δ A b
q0 {q0} {q0, q1}
q1 {q2} {q1}
q2 {q3} {q2}
q3 {q1} {q2}

2.Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition
.follow the steps of theorem:-
(a). String contains ‘ab’ as substring.

(b). String contains at most two ‘a’.


Set 3

1 Convert the following NFA to its equivalent DFA


using the steps of theorem.

(a) M = ({q0, q1, q2}, {a, b}, {δ(q0, a) = {q0, q1}, δ (q0, b) = {q2}, δ (q1, a) = {q2}, δ (q1,
b) = {q0}, δ (q2,a) = Φ, δ (92, b) = {q2, q1}}, q0, {q2})

2.Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition
.follow the steps of theorem:-
(a).String either starts with ‘a’ and ends with ‘a’ or starts with’ b’ and ends with’ b’.

(b). String exactly contain two ‘a’.

Set4

1. Convert the following NFA to its equivalent DFA


using the steps of theorem.

(a) M = ({q0, q1, q2}, {a, b}, {δ(q0, a) = { q1}, δ (q0, b) = {q2,q0}, δ (q1, a) = {q0}, δ (q1, b)
= {q0,q1}, 8(q2,a) = Φ, 8(q2, b) = {q0, q1}}, q0, {q2})

2. Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow
the steps of theorem:-
(a) String whose 4th symbol from first is ‘a’.
(b) String which contains even no. of ‘b’.

Set 5

1. Convert the following NFA to its equivalent DFA


using the steps of theorem.

(a) M = ({q0, q1, q2}, {a, b}, {δ(q0, a) = { q1}, δ (q0, b) = {q2}, δ (q1, a) = {q0,q2}, δ (q1, b)
= {q0}, δ (q2,a) = {q1,q2}, δ (q2, b) = { q1}}, q0, {q2})

2. Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow
the steps of theorem:-
(a) String having total length as even.
(b) String whose 3rd symbol from first is ‘b’.
Set 6
1.Convert the following NFA to its equivalent DFA .
using the steps of theorem.
(a) M = ({q0, q1, q2, q3}, {0, 1},δ, q0, {q3})
Where
δ 0 1
q0 {q0} {q0,q1}
q1 {q2} {q1,q2}
q2 {q3} {q2}
q3 {q3} {q3}

2.Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow
the steps of theorem:-

(a)String starts with b’s and is of even length.


(b) String contains ‘aa’ as substring.

Set 7
1.Convert the following NFA to its equivalent DFA .
using the steps of theorem.
(a) M = ({q0, q1, q2, q3}, {0, 1},8 , q0, {q3})
Where
8 0 1
q0 {q0,q1} {q1}
q1 {q2} {q1}
q2 {q2,q3} {q2}
q3 {q3} {q3}

2.Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow the
steps of theorem:-
(a). String whose total length is either 2 or 3.
(b). String contain at least two ‘a’.

Set 8
1. Convert the following NFA to its equivalent DFA
using the steps of theorem.
(a) M = ({q0, q1, q2, q3}, {0, 1},δ , q0, {q3})
Where
δ 0 1
q0 {q0,q1} {q1}
q1 {q2} {q1}
q2 {q3} Φ
q3 {q3} {q3}
2.Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow the
steps of theorem:-
(a). String whose total length is divisible by 3.
(b). String exactly contain two ‘b’.

Set 9
1.Convert the following NFA to its equivalent DFA
using the steps of theorem.
(a) M = ({q0, q1, q2, q3}, {0, 1},δ , q0, {q3})
Where
δ 0 1
q0 {q0,q1} Φ
q1 {q2} {q1}
q2 {q3} {q2}
q3 {q3} {q3}

2. Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow the
steps of theorem:-
(a). String which contains even no. of ‘a’
(b). String contain at least two ‘b’.

Set 10
1.Convert the following NFA to its equivalent DFA
using the steps of theorem.
(a) M = ({q0, q1, q2, q3}, {0, 1},δ , q0, {q1})
Where
δ 0 1
q0 Φ {q0,q1}
q1 {q2} {q1}
q2 {q3} {q2}
q3 {q2} {q3}

2. Find the DFA which accepts all the String over Σ = {a, b} satisfy the condition .follow the
steps of theorem:-
(a). String which ends ‘aba’
(b). String contain exactly 3 number of ‘b’.

Potrebbero piacerti anche