We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Assignment No. 2 of CS402 has been uploaded. The due date to submit the assignment is July 14th, 2016

Assignment No. 02
Semester: Spring 2016
Theory of Automata – CS402

 

Total Marks: 20

 

Due Date:  14/07/2016

 

Objectives:

Objective of this assignment is to assess the understanding of students about:

  • Union of Regular Languages
  • Intersection of Regular Languages
  • Transition Table
  • Finite Automaton

 

Instructions:

Please read the following instructions carefully before submitting assignment:

  1. 1.     You should consult the recommended books, PowerPoint slides and video lectures to clarify your concepts.
  2. 2.    You are supposed to submit your assignment in .doc format. Any other formats like scan images, PDF, zip, rar and bmp etc will not be accepted.
  3. 3.    It should be clear that your assignment will not get any credit if:

 

  • The assignment is submitted after due date.
  • The assignment is copied from Internet or from any other student.
  • The submitted assignment does not open or file is corrupt.

 

Note: No assignment will be accepted after the due date through email in any case (load shedding, server down, internet malfunctioning etc.). It is recommended to upload solution file at least two days before its closing date.

 

 

For any query about the assignment, contact at cs402@vu.edu.pk

 

 

Question 1:                                                                                                                                Marks:10   10

Consider the following FAs corresponding to regular languages L1 and L2, defined over the alphabet Σ = {a, b}.

 

FA1 corresponding to L1

FA2 corresponding to L2

 

 

You are required to draw a transition table for the FA corresponding to L1 ∩ L2.

 

 

Question 2:                                                                                                                               Marks: 10

 

Given the FAs corresponding to L1 and L2 in Question 1, you are required to draw an FA corresponding to L1c ∪ L2c.

 

 

 

BEST OF LUCK

 

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 4363

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Attachments:

Replies to This Discussion

CS402 - Theory of Automata
Assignment # 2 Complete Solution
Semester: Spring 2016

Attachments:

First of all, we always get a bonus day for each assignment of every subject in case of an emergency. In question number 1 they asked only for transition table and no diagram and in Question 2 they asked only for a diagram but no table. In many solutions I saw a diagram with the table. Why is that so?

In preparing this subject and attempting the assignments, what the students refer the most? Slides, video lectures, handouts or books?

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.