CS402 - Theory of Automata Assignment # 01 Due Date Jun 02, 2020

[+¢αяєℓєѕѕ gιяℓ]

Lecture Cover: 1 to 7

Due Date: 02 June. 2020

[+ M.Tariq Malik]

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

Students having same subject can start discussion here to solve assignment, GDB & Quiz and can clear their concepts until solution is provided. 

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

Then copy Questions from assignment file and paste in Discussion.

 

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

+ http://bit.ly/papersvu (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)

[+ M.Tariq Malik]

CS402 ASSIGNMENT NO.1 SOLUTION SPRING 2020

CLICK HERE TODOWNLOAD THE SOLUTION FILE FROM HERE

[Shakha]

#cs402 #cs402assignmentno1solutionspring2020
CS402 Assignment no 1 Solution Spring 2020 | file also provided | 100% Correct

[+ M.Tariq Malik]

CS402 Assignment 1 Solution Spring 2020

#cs402 #cs402assignmentsolution1spring2020 #vuhashimali #cs402theroyofautomata
CS402 Assignment 1 Solution 2020 i'll provide you compelte guideness about Lanauges and what is the basic alphabet use in cs402 theory of atuomata assignment 1 so please keep wacthing and sharing with your all besties and frinds

[+ M.Tariq Malik]

Another solution idea

CS402_Assignment_No_01_Solution_Spring_2020

below link 

CS402_Assignment_No_01_Solution_Spring_2020

[0zryc8dno5v9u]

thanks sir 

[Zari]

same as assignmnt of fall2019

just values change

[+ M.Tariq Malik]

#CS402ASSIGNMENTNO1SPRING2020 #CS402 #VIRTUALUNIVERSITYOFPAKISTAN
CS 402 Assignment No 1 Solution Spring 2020 | Virtual University |

CS 402 Assignment No 1 Solution Spring 2020 Virtual University of Pakistan
Question 1:
Show that the following pairs of regular expressions define the same language over the alphabet L = {p, q }.
(i) (pq)*p and p(qp)*
(ii) (p* + q)* and (p + q)*
(iii) (p* + q*)* and (p + q)*

Question 2:
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 no word contains the sub string yyy.

#CS402ASSIGNMENTNO1SPRING2020
#CS402
#VIRTUALUNIVERSITYOFPAKISTAN
#VuofPakistan
#FASTScienceAcademy
#FASTAcademy
#FASTIAN
#This_is_for_you

Assignment No 1 Spring 2020 CS 402
CS 402 assignment no 1 spring 2020
CS 402 Assignment No 1 Solution spring 2020

[+.Ãŋɠɜʆḁ.+]

solution in word file plz

[+ M.Tariq Malik]

CS402 Theory of Automata Assignment 1 Solution & Discussion Spring 2020

---

	Assignment No. 01 Semester: Spring 2020 Theory of Automata – CS402	Total Marks: 20 Due Date:  06-01-20
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 [e-mail]   Question:                                           Marks = 20 Q1. Show that the following pairs of regular expressions define the same language 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 no word contains the substring yyy.