Scribd
Upload
7 views2 pages

Spring 2025 - CS402 - 1

This document outlines the assignment details for Theory of Automata (CS402) with a total of 20 marks, due on May 12, 2025. It emphasizes strict submission rules, including format requirements and penalties for late or plagiarized submissions. The assignment focuses on creating a regular expression and a finite automaton for a specified language involving the characters 'a' and 'b'.

Uploaded by

nasreenliaqat00
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
7 views2 pages

Spring 2025 - CS402 - 1

This document outlines the assignment details for Theory of Automata (CS402) with a total of 20 marks, due on May 12, 2025. It emphasizes strict submission rules, including format requirements and penalties for late or plagiarized submissions. The assignment focuses on creating a regular expression and a finite automaton for a specified language involving the characters 'a' and 'b'.

Uploaded by

nasreenliaqat00
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 Date
Spring 2025 12th May, 2025

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)

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 file 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 at:
[email protected]
Question Marks (5+15=20)

Write the regular expression for language of all words starting with “a” and ending with “b” must having
“ab” as a substring over the set of alphabets Σ={a,b}.

Also draw the Finite Automaton (DFA) for above language.

You might also like