Re: CS402 Assignment 3 Solution and Discussion
Assignment No. 03
Semester: Spring2020
Theory of Automata – CS402
Total Marks: 20
Due 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:
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 atCS402@vu.edu.pk
Total Marks: Marks = 20
Question:
Prove with the help of De-Morgan’s law that
[image: z35ZJP5.png]
Where L1& L2 are represented with FA1 & FA2 respectively:
L1=FA1
[image: FHVUNVi.png]
L2 = FA2
[image: NQn1Z7s.png]
BEST OF LUCK
Re: CS402 Assignment 2 Solution and Discussion
Assignment No. 02
Semester: Spring 2020
Theory of Automata – CS402
Total Marks: 20
Due 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:
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: Marks = 20
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.
[4 + 8 + 8 = 20 marks]
BEST OF LUCK
Assignment No. 03
Semester: Fall 2019
Theory of Automata – CS402
Total Marks: 20
Due 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 cs402@vu.edu.pk
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.
[image: rOTeTuM.png]
BEST OF LUCK
Assignment No. 02
Semester: Fall 2019
Theory of Automata – CS402
Total Marks: 20
Due 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:
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 = 10 Q1: Derive the regular Expressions (RE) for the following DFA. You are required to mention all the required steps.
[image: POz7AzH.png]
Question No 2: Marks =10
Q2: Derive the regular Expressions (RE) for the following DFA. You are required to mention all the required steps.
[image: iiC6onI.png]
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: 20
Due 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:
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
Question: Marks = 20
Q1. Show that the following pairs of regular expressions define the same language over the alphabet
L = {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
cs 402 gdb solution fall 2020
-
-
CS 402 GDB 1 SOLUTION FALL 2020
FINITE AUTOMATA (FA):
Finite Automata
= PDA with finite stack.
= TM with finite tape.
= TM with unidirectional tape.
= TM with read only tape.PUSH DOWN AUTOMATA (PDA):
PDA = Finite Automata with StackTURING MACHINE ™:
Turing Machine
= PDA with additional stack.
= FA with 2 stacks.
The Applications of these Automata are given as follows:-
Finite Automata (FA) –
• For the designing of lexical analysis of a compiler.
• For recognizing the pattern using regular expressions.
• For the designing of the combination and sequential circuits using Mealy and Moore Machines.
• Used in text editors.
• For the implementation of spell checkers. -
Push Down Automata (PDA) –
• For designing the parsing phase of a compiler (Syntax Analysis).
• For implementation of stack applications.
• For evaluating the arithmetic expressions.
• For solving the Tower of Hanoi Problem. -
Linear Bounded Automata (LBA) –
• For implementation of genetic programming.
• For constructing syntactic parse trees for semantic analysis of the compiler. -
Turing Machine ™ –
• For solving any recursively enumerable problem.
• For understanding complexity theory.
• For implementation of neural networks.
• For implementation of Robotics Applications.
• For implementation of artificial intelligence.
-
-
Z zaasmi has marked this topic as solved on
PAK VS BAN Live
File Sharing
