cs402 solution spring 2011
Theory of Automata (CS402)View more random threads:
- CS607 Artificial Intelligence Assignment no 4 Spring 2011...
- CS402 Theory of Automata Assignment no 3 spring May 2012
- CS402 theory of Automata assignmment no 4 fall January 2012
- need cs501 3rd assignment idea
- cs402 idea solution assignment no 2 fall 2010
- CS401 Assignment No. 04 Semester Assignment No. 04...
- CS614- Data Warehousing assignment no 5 idea solution fall...
- CS615 Assignment no 5 ide solution fall 2011 January 2012
- CS502 Assignment No.3 fall Semester fall 24 December 2011
- CS302 Digital Logic Design Assignment No 3 Fall 20...
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
Sponsored Links
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,
Last edited by Vuhelper; 06-02-2011 at 08:40 PM.
cs402 solution spring 2011
Thanx for the Solution
welcome dera
There are currently 1 users browsing this thread. (0 members and 1 guests)