You are on page 1of 2

THEORY OF AUTOMATA

ASSIGNMENT#1
BS-CS 7TH B,E
Department: CS & IT
Course Instructor: Ms. Maryam Total weight-age Marks: 10

Description:

Assignment consists of two questions related to the material covered in the class and emphasize on the basic concepts. Type your assignment in
Word documents.

Objective:

The objective of this assignment is to inculcate the research culture and basic fact finding factor in students which will help them to further
probe in their studies.

Guidelines:

 It is individual assignment and must be submitted in hard form.


 The date of submission 8th Sep,2022, submit on Google class room . Bring it in hard form during class time.

Evaluation Criteria for Assignment:

10 marks. (10% weightage in final evaluation)

Sub- CLO Domian/BT Total Marks


Question
Question Code Level
1 6 1 C2 12
2 8 1 C2 16
3 4 2 C3 08
Total 36

Q#1 Write the regular expression of the following Language at least 3 over alphabet Σ
= {a,b}a,b}:

 Language containing no words starting and ending on “a”

 Languages containing only words starting and ending on same letter


 Language of all words with a appears in pairs only
 Language of all words not ending on “b”
 Language of all words with count of “a “ as multiple of three
 EVEN-EVEN

Department of Computer Sciences & Information Technology, Superior University, Lahore 1


Q#2: Define Languages over alphabet Σ = {a,b}a,b}

1. L1= Language of all words starting and ending with different letters

2. L2=Language of all words containing substring abb

3. L3=Language of all words containing substring abb or baa

4. L4=Language of all words not containing substring abb

5. L5= ODD-ODD / EVEN-ODD

6. L6=Language of all words with count of ‘a’ as multiple of three

7. L7=Language of all words with count of ‘a’ as not multiple of three

8. L8=Language of all words with a as 2nd letter..

Q#3: Define recursive definition of the following:

1. L1= Language of all words containing 4 a’s and 2 b’s exactly.

2. L2=Languages containing only words starting and ending on same letter


along with sub string bb.

3. L3= language of summation series.

4. L4= Language of multiple of 6.

Important Note:

Student must be followed above mentioned deadline otherwise your


assignment will not be accepted. Please read instructions carefully before
submission of assignment.

Department of Computer Sciences & Information Technology, Superior University, Lahore 2

You might also like