Theory 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: Untitled+1.jpg]](http://3.bp.blogspot.com/-jTm_ghIawnA/TedmTEBhLeI/AAAAAAAAATE/36oLuXeA2f4/s320/Untitled+1.jpg)
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,
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
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,
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]
for the Solution