CS402 ASSIGNMENT 1. SOLUTION (SPRING2020)

CS402 assignment 1 solution 2020

cs402 assignment 1 solution 2020





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: 
                                                                                                                   Marks = 20
Q1. Show that the following pairs of regular expressions define the samelanguage over the alphabet

L = {p, q}.

(i) (pq)*p         and    p(qp)*
(ii) (p* + q)*    and    (p + q)*
(iii) (p* + q*)* and    (p + q)*
[15 marks = 5*3]
Q2. Write a regular expression for the following language over the alphabet L = {x, y} such that it accepts all strings in which the letter y is never tripled. This means that noword contains the substring yyy.[5 marks]

cs402 assignment 1 solution spring 2020






YouTube Video link



cs402 assignment solution 2020



FILE Download Link

Post a Comment

0 Comments