-
Re: CS402 Assignment 1 Solution and Discussion
Please share CS402 Assignment 1 Fall 2020
-
Re: CS402 Assignment 3 Solution and Discussion
Assignment No. 03Semester: Spring2020
Theory of Automata – CS402
Total Marks: 20Due Date: 27 July, 2020
Objectives:
Objective of this assignment is to assess the understanding of students about the concept of Complement, Union and Intersection of FAs using De-Morgan’s law.Instructions:
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:
Please read the following instructions carefully before submitting assignment:
• 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 [email protected]
Total Marks: Marks = 20
Question:Prove with the help of De-Morgan’s law that
Where L1& L2 are represented with FA1 & FA2 respectively:
L1=FA1
L2 = FA2
BEST OF LUCK
-
Re: CS402 Assignment 2 Solution and Discussion
Assignment No. 02Semester: Spring 2020
Theory of Automata – CS402
Total Marks: 20Due Date: June 15, 2020
Objectives:
Objective of this assignment is to assess the understanding of students about the concept of FA, NFA, DFA and conversion from Regular expression to NFA and NFA to FA and DFA.Instructions:
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:
Please read the following instructions carefully before submitting assignment:
• 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 [email protected]
Question: Marks = 20
[4 + 8 + 8 = 20 marks]
Q. Write a regular expression for a language over alphabet L = {a,b} accepting all strings and ending with b only. Convert the given regular expression into NFA and then convert the NFA to DFA.BEST OF LUCK
-
-
Assignment No. 03
Semester: Fall 2019
Theory of Automata – CS402
Total Marks: 20Due Date: 20-01-2020
Objectives:
Objective of this assignment is to assess the understanding of student’s about the concept of languages, regular expressions and finite automata and GTG.
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 the due date.
• The assignment is copied from Internet or from any other student.
• The submitted assignment does not open or the 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 [email protected]
Question: Marks=20
Determine whether the following Finite Automata accepts any word or not.
You need to use Method-2, and perform each and every step involved in this process and at the last you have to mention explicitly whether the given Finite Automata accepts any word or not.BEST OF LUCK
-
Assignment No. 02
Semester: Fall 2019
Theory of Automata – CS402
Total Marks: 20Due Date: 02 Dec, 2019
Objectives:
Objective of this assignment is to assess the understanding of students about the concept of languages, regular expressions and finite automata and GTG.Instructions:
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:
Please read the following instructions carefully before submitting assignment:
• 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 [email protected]
Question No 1: Marks = 10 Q1: Derive the regular Expressions (RE) for the following DFA. You are required to mention all the required steps.
Question No 2: Marks =10
Q2: Derive the regular Expressions (RE) for the following DFA. You are required to mention all the required steps.Note: Providing direct solution without step by step process will be not be accepted for both the questions.
BEST OF LUCK
-
Assignment No. 01
Semester: Fall 2019
Theory of Automata – CS402
Total Marks: 20Due Date: November 15, 2019
Objectives:
Objective of this assignment is to assess the understanding of students about the concept of languages, regular expressions and finite automata.Instructions:
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:
Please read the following instructions carefully before submitting assignment:
• 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
Question: Marks = 20
Q1. Show that the following pairs of regular expressions define the same language over the alphabetL = {a, b}.
(i) (ab)a and a(ba)
(ii) (a* + b)* and (a + b)*
(iii) (a* + b*)* and (a + b)*
[9 marks = 3*3]
Q2. Develop a regular expression for the following language over the alphabet P = {a, b} such that it accepts all strings in which the letter b is never tripled. This means that no word contains the substring bbb. [5 marks]Q3. Develop a regular expression for the following language over the alphabet P = {a, b} such that it accepts all strings all words in which a is tripled or b is tripled, but not both. This means each word contains the substring aaa or the substring bbb but not both. [ 6 marks]
BEST OF LUCK
CS402 Assignment 1 Solution and Discussion
-
Re: CS402 Assignment 1 Solution and Discussion
Please share CS402 Assignment 1 Fall 2020
-
@zaasmi said in CS402 Assignment 1 Solution and Discussion:
Re: CS402 Assignment 1 Solution and Discussion
Please share CS402 Assignment 1 Fall 2020
Theory of Automata (CS402)
Assignment # 01
Fall 2020
Total marks = 20 30th November, 2020
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should concern the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
Topic Covered:
Objective of this assignment is to assess the understanding of students about:
· The concept of languages
· Regular Expressions
· Finite automata.
NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you people find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
Questions No 01 Marks (10)
Construct a FA which recognizes the set of all strings defined over ∑= {0, 1} ending with the suffix ‘10’. Also draw transition table for that language.
Questions No 02 Marks (10)
Identify the language L accepted by the following regular expression abab(a + b)*. Also define the recursive definition of that language.
Which of the following string(s) is/are part of language L defined as above?
baaba
aabaa
abbbab
babaa