 |
Assignment No. 01
Semester: Spring 2016 Theory of Automata – CS402 |
Total Marks: 20
Due Date: Expired
|
|
Objectives:
Objective of this assignment is to assess
the understanding of students of Sets, Alphabets, Languages, Regular
Expression and Finite Automata.
Instructions:
Please read the following instructions
carefully before submitting assignment:
·
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 cs402@vu.edu.pk
Question 1:
Marks:5+5
10
Write regular expression for each of the following
languages over alphabet set {a.b}.
I)
Language of all those strings which end with
substring ‘ab’ and have odd length.
(a+b)((a+b) (a+b))*(ab)
II)
Language of all those strings which contain no more
than two b’s.
a*ba*ba*+a*ba*+a*
Question 2:
Marks: 10
You are required to construct an
FA for the language of all those strings whose length is Odd, but contain
even number of b’s defined over alphabet set {a,b}.
 |
||
|
BEST OF LUCK
|
||
Home / CS402 /
CS402 Assignment No. 01 /
Semester: Spring 2016 /
Theory of Automata – CS402
/ Theory of Automata – CS402 Assignment No. 01 Semester: Spring 2016
- Blogger Comment
- Facebook Comment
Subscribe to:
Post Comments
(
Atom
)
0 comments:
Post a Comment