Tatyasaheb Kore Institute of Engineering and Technology, Warananagar

(An Autonomous Institute, Affiliated to Shivaji University, Kolhapur)

Department of Computer Science and Engineering

Assignment Questions:
Assignment – 1
1.
Regular expression for the given language = (0 + 1)*01
2. Draw a DFA for the language accepting strings ending with ‘abb’ over input alphabets ∑ = {a, b}
3. Draw a DFA for the language accepting strings ending with ‘abba’ over input alphabets ∑ = {a, b}
4. Draw a DFA for the language accepting strings ending with ‘0011’ over input alphabets ∑ = {0, 1}
5. Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets ∑ = {a, b} . Also
draw the regular expression for given language.
6. Draw a DFA for the language accepting strings starting with ‘a’ over input alphabets ∑ = {a, b}

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

8. 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’.
9. 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’.
10. Construct a DFA that accepts a language L over input alphabets ∑ = {a, b} such that L is the set
of all strings starting with ‘aba’.
11. Consider a language L(M) = { (10)n: n >= 0 } Draw NDFA also Draw Equivelent DFA .

12.

Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata
(DFA)-
13.

Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite

Automata (DFA)-

14. Find regular expression for the following DFA

15. Find regular expression for the following DFA

16.
Find regular expression for the following DFA-

17.

Find regular expression for the following DFA

18.

Find regular expression for the following DFA-

19. Find regular expression for the following DFA

20. Design a Moore machine to generate 1's complement of a given binary number.
21.

Design a Moore machine for a binary input sequence such that if it has a substring 101, the
machine output A, if the input has substring 110, it outputs B otherwise it outputs C.
22.

Construct a Moore machine that determines whether an input string contains an even or odd
number of 1's. The machine should give 1 as output if an even number of 1's are in the string
and 0 otherwise.
23.

Design a Mealy machine for a binary input sequence such that if it has a substring 101, the
machine output A, if the input has substring 110, it outputs D otherwise it outputs k.
24.

Design a mealy machine that scans sequence of input of 0 and 1 and generates output 'A' if the
input string ends with 00, output 'B' if the string ends with 11, and output 'C' otherwise.
25.

25.Convert the following Mealy machine into equivalent Moore machine.

26.

26.Convert the following Mealy machine into equivalent Moore machine.

27. 27.Convert the following Moore machine into its equivalent Mealy machine.

28.

28.Convert the given Moore machine into its equivalent Mealy machine.
29.
Design an NFA with ∑ = {0, 1} accepts all string ending with 01.
30.
Design an NFA with ∑ = {0, 1} in which double '1' is followed by double '0'. 31. Design an NFA in

which all the string contain a substring 1110.

31.
Convert the following NFA with ε to NFA without ε.

32.

Convert the given NFA to DFA.

33. Convert the given NFA to DFA.

34.

Design a FA from given regular expression 10 + (0 + 11)0* 1.

35.

Explain NFA with ε moves also explain the process of eliminating ε from NFA.