Jaypee Institute of Information Technology –Noida Tutorial –02 Finite Automata Note: Ask all the students to make a tutorial notebook and all the questions given in the tutorial must be solved in it. Questions in bold are to be solved in the tutorial class only. 1.Find D.F.A. accepts equivalent to M=({q0 , q1 , q2 },{a,b}, , q0 {q2})
and transition is given in table a b Q\ q0 q0,q1 q2 q1 q0 q1 q2 q0,q1 --
2.Construct D.F.A. which is equivalent to N.F.A.
and transition Q\ Q0 q1 q2 q3
M=({q0 , q1 , q2 , q3 },{a,b}, is given in table. 0
, q0 ,{q3}) 1
q0,q1 q2 q3
--
q0 q1 q3 q2
3.Design D.F.A. for given N.F.A. where, M=({p , q , r , s },{0,1}, , p ,{q , s}) and transition, is given in table. 0 1 Q\
p q r s
q,s r s
--
q q,r p p
4.Design a Moore machine that gives an output „1‟ if input of binary sequence a „1‟ if input of binary sequence a „1‟ is preceded by exactly two zero‟s. 5. Design a Moore and Mealy machine for a binary input sequence , if it ends in 101, output is „A‟, if ends in „110‟ output is B, otherwise „C‟. 6.Design Moore and Mealy machine to convert each occurrence of sub-string 100 by 101. 7. Design a Moore machine and Mealy machine for Binary input sequence , output „A‟ if „101‟is recognized output „B‟. 8.Design Mealy Machine for the following table and also find the output for the string “abbabaaa”. a b o/p Q\ 0 q0 q3 q2 0 q1 q1 q0 1 q2 q2 q3 0
q3
q3
q1