CS402 Assignment#1 Solution Spring 2018

	Assignment No. 01 Semester: Spring 2018 Theory of Automata – CS402	Total Marks: 15 Due Date: 9/5/2018
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: You should consult the recommended books, PowerPoint slides and audio lectures to clarify your concepts. 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. 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 No 1:                                                                                                                 Marks:5 Construct a regular expression (RE) defining each of the following languages over the alphabet ∑={a   b}: a)      All words ends in 3 consecutive b. R.E = (a+b)*bbb b)      All words having at least one ‘a’ R.E = (a+b)*a(a+b)                 Question No 2:                                                                                                   Marks=5+5=10 Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix ‘xy’.
BEST OF LUCK