LOVELY PROFESSIONAL UNIVERSITY

HOME WORK: #1
CSE321 : Automata Theory
School: LSTCA Department: CSE/IT
Class: 3rd year CS Term: 2 nd
Section: E1801
Max. Marks: 07 DOA: 23nd DOS: 31st Jan, 2011

Part- A
Question1: Define Finite State Machine. List out characteristics and
applications of FSM.

Question2: convert to a DFA the following NFA (where * denotes form final state)

Question3: Construct NFA’s to recognize the following set of strings.

a) abcc, abd, aabd. Assume the alphabet is {a,b,c,d}.

b) 1001, 1010, 0110. Assume the alphabet is {0,1}

PART B

Question4: Convert the given Mealy machine into Moore machine.

Note: Starting state is q1.

Question5: Minimize the given FSM.

Question6: Write some similarities and differences between Mealy and Moore machine.