Scribd Logo
Upload

Welcome to Scribd!

  • Assignment No. 01 Semester: Spring 2019 Theory of Automata - CS402

    Uploaded by

    Muhammad Ismail
    10 views1 page
    This document is an assignment for a Theory of Automata course. It contains two questions worth a total of 15 marks. Question 1 is worth 5 marks and asks students to write regular expressions for two languages over the alphabet {a,b}. Question 2 is worth 10 marks and asks students to construct a finite automaton that recognizes strings starting with the prefix "xy" over the alphabet {x,y}. The document provides the due date and a link for additional resources.

    Original Description:

    Original Title

    Spring-2019_CS402_-Solution(mJZ3LB)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is an assignment for a Theory of Automata course. It contains two questions worth a total of 15 marks. Question 1 is worth 5 marks and asks students to write regular expressions for two languages over the alphabet {a,b}. Question 2 is worth 10 marks and asks students to construct a finite automaton that recognizes strings starting with the prefix "xy" over the alphabet {x,y}. The document provides the due date and a link for additional resources.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    Assignment No. 01 Semester: Spring 2019 Theory of Automata - CS402

    Uploaded by

    Muhammad Ismail
    This document is an assignment for a Theory of Automata course. It contains two questions worth a total of 15 marks. Question 1 is worth 5 marks and asks students to write regular expressions for two languages over the alphabet {a,b}. Question 2 is worth 10 marks and asks students to construct a finite automaton that recognizes strings starting with the prefix "xy" over the alphabet {x,y}. The document provides the due date and a link for additional resources.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Assignment No.

    01
    Total Marks: 15
    Semester: Spring 2019
    Theory of Automata – CS402 Due Date: 13/5/2019

    Question No 1: Marks:5
    Construct a regular expression (RE) defining each of the following languages over the alphabet
    ∑={a b}:

    • All words ends in 3 consecutive b.


    • All words having at least one ‘a’

    Answer:
    • R.E=(a+b)*bbb

    • R.E=(a+b)*a(a+b)

    Question No 2: Marks=5+5=10
    Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix
    ‘xy’.

    BEST OF LUCK

    https://vustudents.ning.com/

    You might also like