CS402 Assignment No. 3 Announced
Thursday, June 02, 2011 Posted In CS and IT Edit ThisTheory of Automata (CS402)
Assignment No.3
Total Marks: 20 Due Date: 09-06-2011
Rules for Marking
It should be clear that your assignment will not get any credit if:
- The assignment is submitted after due date
- The assignment is copied
Objectives:
After completing this assignment you will be able to have a great deal of understanding of:
- Moore machine
- Mealy machine
- Regular language
- Non-regular language
- Complement method
Question No.1
Moore and Mealy machine
Consider the following Moore machine
IMAGE HERE
a) Draw the transition table
b) Run the string babbab over the above machine and determine corresponding output string plus table as well.
c) Convert given Moore machine into an equivalent Mealy machine
Question No.2
Regular Languages
Consider FA1 and FA2 representing languages L1 and L2 given below,
IMAGE HERE
Prove that Language representing FA1
FA2 is regular using complement method.
FA2 is regular using complement method.Hint:
We know that a language is regular if it’s RE or FA or TG exists, so to prove L1
L2 is regular you need to find FA1 U FA2 using complement method
L2 is regular you need to find FA1 U FA2 using complement method [First find L1c and L2c Then L1c ∩ L2c then (L1c∩ L2c) c then find out the final FA as (L1c∩ L2c) c = L1 U L2
Assignment Uploading Instructions:
Upload single word file in office 2003 format having solutions for all questions.
