CS402 Assignment No 1 Solution Fall 2017

CS402 Assignment No 1 Solution Fall 2017:

Dear Students, Here You can read and Download CS402 - Theory of Automata 
Assignment no 1 Solution and discussion fall 2017. CS402 Assignment 
Due Date: 06/11/2017. Assignment Total Marks: 15.

You Can Also Download Solved Mid Term Papers, Short Notes, Assignment Solutions, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quiz, Solved Mid Term Subjective Papers, Solved Mid Term Objective Papers, Solved Final Term Objective Papers, Solved Final Term Subjective Papers from VU Ki Duniya for Preparation of Mid Term Papers.

CS402 Complete Assignment No 1 Solution Fall 2017:

Assignment No. 01
Semester: Fall 2017
Theory of Automata – CS402

Objectives:

Objective of this assignment is to assess the understanding of students about the concept of languages, regular expressions and finite automata.

Instructions:

Please read the following instructions carefully before submitting assignment:

1. You should consult the recommended books, PowerPoint slides and audio lectures to clarify your concepts.
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. 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 atcs402@vu.edu.pk

Question No.1:

Construct a regular expression defining each of the following languages over the alphabet ∑={a        b}:

1. All words without the pattern ‘bb’ in them.
2. All words that ends with a or bbbb

Question No.2:

Build an FA that accepts the language of all words over the alphabet ∑= {a    b} that have exactly two a’s.

You May Also Like:

• CS605 Complete Assignment No.1Solution Fall 2017
• CS606 Complete Assignment No.1Solution Fall 2017
• CS201 Complete Assignment No.1Solution Fall 2017
• CS101 Complete Assignment No.1Solution Fall 2017

Download Complete Solution:

Download CS402 Assignment Solution by Clicking the Download Button Below in just single Click.