Scribd
Upload
22 views2 pages

Spring 2024 - CS402 - 1

The document provides instructions for an assignment on automata theory covering regular expressions, finite automata, transition graphs, and generalized transition graphs. It details topics to be assessed, submission guidelines, and contains 3 questions - the first with 3 parts asking to write regular expressions, and the second asking to construct a DFA.

Uploaded by

akbareman13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views2 pages

Spring 2024 - CS402 - 1

The document provides instructions for an assignment on automata theory covering regular expressions, finite automata, transition graphs, and generalized transition graphs. It details topics to be assessed, submission guidelines, and contains 3 questions - the first with 3 parts asking to write regular expressions, and the second asking to construct a DFA.

Uploaded by

akbareman13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Theory of Automata (CS402) Total marks = 20

Assignment # 01 Deadline
May 06, 2024
Spring 2024

Please carefully read the following instructions before attempting the 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 the file is corrupt.
 Strict action will be taken if the submitted solution is copied from any other student or the
internet.

You should consult 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, BMP, etc. will not be accepted.

Topic Covered:
The objective of this assignment is to assess the understanding of students about:
 Regular Expression (RE)
 Finite Automata (FA)
 Transition Graph (TG)
 Generalized Transition Graph (GTG)

Topic Covered
Lecture 01 to Lecture 10

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 assignments in the last hour of the deadline. It is
recommended to upload the solution at least two days before its closing date.

If you people find any mistake or confusion in the 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 me at:


[email protected]
Question No 01 Marks: 3+3+3 = 9

Consider the language L of strings, defined over ∑= {a, b}, Write regular expressions of following:
a. Strings starting with “b” and ending with “a” having “ab” as a substring.
b. Strings containing even number of a’s and ending with “baba” or “bb”.
c. String that having NULL or starts with “a” and having no consecutive b’s in it.

Question No 2: Marks: 11

Construct a Deterministic Finite Automata (DFA) for part C of Question 1.

You might also like