Navigation

    Cyberian
    • Register
    • Login
    • Search
    • Categories
    • Recent
    • Tags
    • Popular
    • Pro Blog
    • Users
    • Groups
    • Unsolved
    • Solved
    Quiz 100% Result
    • cs 402 gdb solution fall 2020

      Muhammad Furqan Jalib 0

      CS 402 GDB 1 SOLUTION FALL 2020 1.docx CS 402 GDB 1 SOLUTION FALL 2020 2.docx

      CS402 - Theory of Automata
    • CS402 Assignment 1 Solution and Discussion

      zaasmi

      Re: CS402 Assignment 1 Solution and Discussion

      Please share CS402 Assignment 1 Fall 2020

      CS402 - Theory of Automata
    • CS402 Assignment 3 Solution and Discussion

      zaasmi

      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 [email protected]

      Total Marks: Marks = 20
      Question:

      Prove with the help of De-Morgan’s law that

      e9fbb913-414f-41e2-bbfd-7d10238ec6f4-image.png

      Where L1& L2 are represented with FA1 & FA2 respectively:

      L1=FA1
      b2c545e0-a94d-49f5-a30d-cf3fb18a8b88-image.png

      L2 = FA2
      49e28c51-d4b8-4da2-ba2d-bf4956d48a68-image.png

      BEST OF LUCK

      CS402 - Theory of Automata
    • CS402 Assignment 2 Solution and Discussion

      zaasmi

      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 [email protected]

      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

      CS402 - Theory of Automata
    • CS402 Assignment 1 Solution and Discussion

      cyberian

      Re: CS402 Assignment 1 Solution and Discussion

      CS402 - Theory of Automata
    • CS402 GDB 1 Solution and Discussion

      zareen

      Theory of automata is study of abstract machines, like Turing Machines, Finite State Machines, Push Down Automata, Mealy and Moore Machines. You have to discuss and explain which kind of automaton machine promisingly can serve as a recognizer for context-free languages.

      CS402 - Theory of Automata
    • CS402 Assignment 3 Solution and Discussion

      zareen
      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 [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.

      ef465984-68d8-498a-9e87-4058f60c4928-image.png

      BEST OF LUCK

      CS402 - Theory of Automata
    • CS402 Assignment 2 Solution and Discussion

      zareen

      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 [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.

      ef22a679-e776-414a-857e-1dcb57da5420-image.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.

      f7093334-7a2a-4b50-bd09-dc1dbbea8184-image.png

      Note: Providing direct solution without step by step process will be not be accepted for both the questions.

      BEST OF LUCK

      CS402 - Theory of Automata
    • CS402 Assignment 1 Solution and Discussion

      zareen
      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

      CS402 - Theory of Automata

    CS402 GDB 1 Solution and Discussion

    CS402 - Theory of Automata
    cs402 discussion fall 2019 gdb 1 solution
    1
    1
    55
    Loading More Posts
    • Oldest to Newest
    • Newest to Oldest
    • Most Votes
    Reply
    • Reply as topic
    Log in to reply
    This topic has been deleted. Only users with topic management privileges can see it.
    • zareen
      zareen Cyberian's Gold last edited by

      Theory of automata is study of abstract machines, like Turing Machines, Finite State Machines, Push Down Automata, Mealy and Moore Machines. You have to discuss and explain which kind of automaton machine promisingly can serve as a recognizer for context-free languages.

      1 Reply Last reply Reply Quote 0
      • First post
        Last post

      50% Off on Your FEE Join US!

      Quiz 100% Result If you want to know how you can join us and get 50% Discout on your FEE ask Cyberian in Chat Room! Quiz 100% Result Quiz 100% Result
      solution1241 discussion1193 fall 2019813 assignment 1425 assignment 2295 spring 2020265 gdb 1246 assignment 382 crw10174 spring 201955
      | |
      Copyright © 2021 Cyberian Inc. Pakistan | Contributors
      Live Chat