DFA Designing:

1. Design a Finite automate the accepts set of strings that every string ends with 00 over
alphabet {0, 1}.
2. Draw the state transition diagram and state table of a deterministic finite state automata
that accept the language L(M ) = { w ε { a,b }* : w does not contain three consecutive b's }
3. Design a Finite automate the accepts set of strings that every string ends with 001 over
alphabet {0, 1}.
4.

5. a) Design a DFA for the language accepting all strings having no more than 3 ‘a’ over input
6. alphabet Σ = {a, b}.
7. b) Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets Σ =
{a, b}.
8. c) Draw a DFA for the language accepting strings not containing 011 substring over alphabets
Σ ={0, 1}.
9. Design a DFA for the following languages over Σ={a,b}. L={vwv: v,w ∈{a,b}*, |v|=2}
10. Design a DFA for the language accepting all strings having no more than 3 ‘a’ over input
alphabet Σ = {a, b}.
11. Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets Σ = {a,
b}.
12.

13. Construct a DFA to accept all the strings which will start with ‘aa’ and end with ‘ab’. ∑=a, b.

14. Construct a DFA to accept all the strings where the string length will be divisible by 3 or |w|

mod 3=0.∑=a, b

15. Construct a DFA to accept all the strings which will start with ‘a’ and followed by ‘bb’. ∑=a,b.

16. Construct a DFA to accept all the strings in the pattern a3bwa3, where ‘w’ is (a, b)*. ∑=a, b
17.

18.

19.

20.

21.

22. Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets ∑ = {a, b}

Solution: L={abω : ω∈{a,b}* }

Regular expression for the given language = ab(a + b)*

Regular expression for the given language = a(a + b)*

24. Draw a DFA for the language accepting strings starting with ‘101’ over input alphabets ∑ = {0, 1}

Regular expression for the given language = 101(0 + 1)*

25. Draw a DFA that accepts a language L over input alphabets ∑ = {0, 1} such that L is the set of all

strings starting with ’00’.

Regular expression for the given language = 00(0 + 1)*

26. Construct a DFA that accepts a language L over input alphabets ∑ = {a, b} such that L is the set

of all strings starting with ‘aa’ or ‘bb’.

Regular expression for the given language = (aa + bb)(a + b)*

27. Draw a DFA for the language accepting all even binary strings over input alphabets ∑ = {0,1}

28. Draw a DFA for the language accepting all binary strings having even length over input

alphabets ∑ = {0, 1}

29. Draw a DFA for the language accepting all strings having even nos. of ‘a’ over input

alphabets ∑ = {a, b}.

30. Draw a DFA for the language accepting all binary strings having even nos. of 0’s and odd

nos. of 1’s over input alphabets ∑ = {0, 1}.

31. Design a DFA for the language accepting all strings where nos. of ‘a’ is divisible by 3 over

input alphabets ∑ = {a, b}

32. Design a DFA for the language accepting all strings where nos. of ‘a’ is divisible by 3 and

‘b’ is divisible by 2 over input alphabets ∑ = {a, b}.

33. Design a DFA for the language accepting all strings ending with ‘ab’ over input alphabets

∑ = {a, b}

34. L={ ω ∈{a,b}* : ηa(ω) mod 3> ηb(ω) mod 2}

35. Design a DFA for the language accepting all strings having ‘abb’ as a substring over input

alphabets ∑ = {a, b}.

36. Design a DFA for the language accepting all strings that do not have‘abb’ as a substring

over input alphabets ∑ = {a, b}.

37. Design a DFA for the language accepting all strings having atleast one ‘a’ over input

alphabets ∑ = {a, b}.

39. Design a DFA for the language accepting all strings having no more than 3 ‘a’ over input

alphabets ∑ = {a, b}.

40. Design a DFA for the language accepting all strings having atleast one ‘a’ and exactly 2

‘bs’ over input alphabets ∑ = {a, b}.

41. Design a DFA for the language accepting all strings that start with end with different

alphabets over input alphabets ∑ = {a, b}.

42. L={ab5wb2 : w ∈{a,b}* }

43. L={abnam : n >= 2, m>= 3}

44. L={w : (na(w) – nb(w)) mod 3 > 0}

45. L={w : (na(w) +2 nb(w)) mod 3 < 2}

46. L={vwv : v, w ∈{a,b}*, |v| = 2 } Regular language

r= aa(a+b)*aa + bb(a+b)*bb+ ab(a+b)*ab+ba(a+b)*ba

47. a) Design a DFA for the following languages over Σ={a,b}. L={vwv: v,w ∈{a,b}*, |v|=2}

48. Design a DFA for the language accepting all strings having no more than 3 ‘a’ over input alphabet
Σ = {a, b}.

49. Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets Σ = {a, b}.

50.

51. Construct a DFA with reduced states equivalent to the regular expression 10 + (0 + 11)0* 1.

52. Convert the R.E. = (a|b)* into DFA

SOLUTION:
[Link]
DFA MINIMIATION
NFA Construction and DFA NFA conversion

1.

2.

3.

4.

5.

6. NFA to DFA conversion

8.
9.

10.

11.
12, Convert Mealy Machine to Moore Machine. 6 What are Kleene Closure and Positive Closure ?
Give example for both.

13.

14 Construct a NFA with ε or λ transition for r = (11 + 0)*(00 + 1)*

15. Give an NFA that accepts the language L ( ( a + b ) b ( a + bb ) )

16. Write the regular expression of the language on ( 0, 1 ) such that it contains at least one double
letter.

17. Design a Finite automate the accepts set of strings that every string ends with 00 over alphabet
{0, 1}. 3. Let Σ = {a,b}, Prove that the Language L = {w ∈ Σ* : na (w) } is not regular.

18.
19. NFA TO DFA CONVERSION AND RELATED PROBLEMS

[Link]

20. NFA AND E-NFA TRANSITION

[Link]

21. NFA E NFA

[Link]

22. PUMPING LEMA

[Link]

23. NFA TO DFA SOLUTION

[Link]

[Link] EXPRESSION READ AND PRACTICE

[Link]

[Link] PRACTICE

[Link]

26. Arden's Theorem: DFA to RE conversion

[Link]

27. REGULAR EXPRESSION TO FINITE AUTOMATA

[Link]

28. EQUIVALANCE OF TO FINITE AUTOMATA

[Link]

29. What will be regular expression over the alphabet {a,b}, for the language L = (anbn : n > = 4,

m< =3} ?

30. A) Write Regular expression for the following

i) L = { anbm: m+ n is even}

ii) L = { anbm: m>=2, n>=2}

B) If L and M are regular languages, then so is L – M.

31. Convert the following regular expression into equivalent NFA with ε- transitions R=(10*)*

32. a) Construct a DFA with reduced states equivalent to the regular expression 10 + (0 + 11)0* 1.

b) Prove (a + b)* = a*(ba*)*

33. Convert the following regular expression into equivalent NFA with ε- transitions R=(10*)*

34. [Link]
[Link] EQUIVALENT OR NOT