cs402 solution spring 2011
Theory of Automata (CS402)View more random threads:
- CS502 assignment no 2 spring 2011
- CS101 Introduction to Computing Assignment No. 03 Semester...
- CS201 Introduction to Programming Fall 2010 second...
- CS201 - Introduction to Programming All spring assignments...
- MGT 301 Principles of Marketing Assignment No 1 Fall...
- CS615 Software Project Management assignment no 4 fall 7...
- CS604 Operating Systems Assignment No. 4 Fall 2012-13 Due...
- CS607 Artificial Intelligence Assignment No.1 Solution...
- CS602-Computer Graphics Assignment No. 02 Fall 2012
- CS101 Assignment#4( help required plz)
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
Sponsored Links
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)