Scribd
Upload
102 views

TOC Assignment 2

j

Uploaded by

rec6718
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
102 views

TOC Assignment 2

j

Uploaded by

rec6718
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 2

1. Draw a DFA for the language accepting strings ending with ‘0’ over input alphabets ∑={0, 1} ?
2. Draw a DFA for the language accepting strings ending with ‘01’ over input alphabets ∑={0, 1} ?
3. Draw a DFA for the language accepting strings ending with ‘00’ over input alphabets ∑={0, 1} ?
4. Draw a DFA for the language accepting strings ending with ‘011’ over input alphabets ∑ = {0, 1} ?
5. Draw a DFA for the language accepting strings ending with ‘0110’ over input alphabets ∑ = {0, 1} ?
6. Draw a DFA for the language accepting strings ending with ‘0011’ over input alphabets ∑ = {0, 1} ?
7. Draw a DFA for the language accepting strings with ‘0’ only over input alphabets ∑={0, 1} ?
8. Draw a DFA for the language accepting strings with ‘0’ and ‘1’ only over input alphabets ∑={0, 1} ?
9. Draw a DFA for the language accepting strings starting with ‘0’ over input alphabets ∑={0, 1} ?
10. Draw a DFA for the language accepting strings starting with ‘01’ over input alphabets ∑={0, 1} ?
11. Draw a DFA for the language accepting strings starting with ‘00’ over input alphabets ∑={0, 1} ?
12. Draw a DFA for the language accepting strings starting with ‘011’ over input alphabets ∑ = {0, 1} ?
13. Draw a DFA for the language accepting strings starting with ‘0110’ over input alphabets ∑ = {0, 1} ?
14. Draw a DFA for the language accepting strings starting with ‘0011’ over input alphabets ∑ = {0, 1} ?
15. Draw a DFA for the language accepting strings starting with ‘00’ or ’11’ over input alphabets ∑ = {0, 1} ?
16. Draw a DFA for the language accepting strings without substring ‘00’ over input alphabets ∑ = {0, 1} ?
17. Draw a DFA for the language accepting even binary numbers strings over input alphabets ∑ = {0, 1} ?
18. Draw a DFA for the language accepting odd binary numbers strings over input alphabets ∑ = {0, 1} ?
19. Draw a DFA for the language accepting odd or even binary numbers strings over input alphabets ∑ =
{0, 1} ?
20. Draw a DFA for the language accepting strings containg even number of total zeros over alphabets ∑ =
{0, 1} ?
21. Draw a DFA for the language accepting strings starting and ending with different characters over input
alphabets ∑ = {0, 1} ?
22. Draw a DFA for the language accepting strings starting and ending with same character over input
alphabets ∑ = {0, 1} ?
23. Draw a DFA for the language accepting strings starting and ending with ‘0’ always over input
alphabets ∑ = {0, 1} ?
24. Draw a DFA for the language accepting strings containing three consecutives ‘0’ always over input
alphabets ∑ = {0, 1} ?
25. Draw a DFA for the language accepting strings such that each ‘0’ is immediately preceded and
followed by ‘1’ over input alphabets ∑ = {0, 1} ?
26. Draw a DFA for the language accepting strings containing at most two ‘0’ over input alphabets ∑ = {0,
1} ?
27. Draw a DFA for the language accepting strings containing at least two ‘0’ over input alphabets ∑ = {0,
1} ?
28. Draw a DFA for the language accepting strings containing exactly two ‘0’ over input alphabets ∑ = {0,
1} ?
29. Draw a DFA for the language accepting strings with ‘011’ as substring over input alphabets ∑ = {0, 1} ?
30. Draw a DFA for the language accepting strings ending in either ’01’, or ’10’ over input alphabets {0, 1}
31. Draw a DFA for the language accepting strings containing ’01’, or ’10’ as substring over input
alphabets ∑ = {0, 1} ?
32. Draw DFA that accepts any string which ends with 1 or it ends with an even number of 0’s following
the last 1. Alphabets are {0,1}.
33. Construct DFA accepting set of all strings containing even no. of a’s and even no. of b’s over input
alphabet {a,b}.
34. Give DFA accepting the language over alphabet {0,1} such that all strings of 0 and 1 ending in 101.
n
35. Construct DFA for a b | n>=0.
36. construct DFA for binary integer divisible by 3 ?
37. Draw a DFA for the language accepting strings containing neither ’00’, nor ’11’ as substring over input
alphabets ∑ = {0, 1} ?

You might also like