Scribd
Upload
13 views

Assignment No2 ToA

Uploaded by

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

Assignment No2 ToA

Uploaded by

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

Assignment No.

02
Instructions for writing assignment:
Use Assignment paper: Stick to standard-sized paper unless specified otherwise.
Margins: Leave a margin on all sides for comments or corrections. Typically, a 1-inch margin on
the left is sufficient.
Title Page:
• Write your name, roll number, subject, and the date on the title page or at the top of the
first page.
• Center the title of the assignment clearly at the top.
Minimal strike-throughs: If you make a mistake, strike it out with a single line instead of
erasing or scribbling.
No white-out: Avoid using white-out or correction fluid as it can look messy.
References
• If you refer to other works, include a simple bibliography or references at the end.
Bind or staple: If your assignment is more than one page, bind or staple it neatly on the top left
corner.

Name of Course Theory of Automata


Course code: CS09305
Semester: 4th
Date of Assign: 28/03/2025

Designed by:
Mr. Ali Hussain
Lecturer at University of Lahore
CS&IT Department
Q# 1 design an NFA, Transition Function(δ:Q×Σ→2^Q) and
Transition Table of the following Questions.
1. Design an NFA with ∑ = {0, 1} for all binary strings where the second
last bit is 1.
2. Design an NFA with input alphabet ∑ = {0, 1} that accepts all
the strings that end with 01.
3. Design an NFA with ∑ = {0, 1} such that every string includes the
substring 1101.
4. Draw NFA for all the strings that contains ‘aa’, defined over alphabet ∑
= {a, b}.
5. Construct an NFA with ∑ = {0, 1} in which each string must contain
“double ‘1’ is followed by single ‘0’.
Q# 2. Design an DFA, Transition Function(δ:Q×Σ→Q) and
Transition Table of the following Questions.
1. Draw an NFA with ∑ = {0, 1} such that the third symbol from the right
is “1”.
2. Construct an NFA with ∑ = {0, 1}, where each string must contain
either “01” or “10”.
3. Draw NFA for string that contain at least one ‘a’ and end with ‘b’
defined over alphabet ∑ = {a, b}.
4. Please design an NFA with input alphabet ∑ = {0, 1} that accepts all
the strings that end with 01.
5. Design an NFA with ∑ = {0, 1} such that every string includes the
substring 1101.

You might also like