Theory of Automata – CS402 Assignment No. 01

ansarali

Objectives:

Objective of this assignment is to assess the understanding of students aboutthe concept of languages, regular expressions and finite automata.

 

Instructions:

Please read the following instructions carefully before submitting assignment:

1. You should consult the recommended books, PowerPoint slides and audio lectures to clarify your concepts.
2. You are supposed to submit your assignment in .doc format. Any other formats like scan images, PDF, zip, rar and bmp etc will not be accepted.
3. It should be clear that your assignment will not get any credit if:

·        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[email protected]

Question No 1:                                                                          Marks:5

Construct a regular expression (RE) defining each of the following languages over the alphabet

∑={ab}:

a)     All words ends in 3 consecutive b.

b)     All words having at least one ‘a’

Question No 2:                                                                          Marks=5+5=10

Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix ‘xy’.

BEST OF LUCK

ansarali

solution.Spring 2019_CS402_1.docx

ansarali

[15/02, 1:40 pm] +92 323 4134266: Today cs402 papr
Mcq from mooaz and waqar file 45%
Regular Experation to CFG(context free gramer)
PDA graph draw karna tha
CFD dia huwa tha uska regular exprastion finde karna tha
2 long graph waly thy unki output btani thi.
Last m Explain the PDF daigram state and symbols

[15/02, 1:40 pm] +92 323 4134266: Cs402 today final term paper.
Mcqs kuch past Sy thy baki book sy thy
Long question.
FA bnana tha condition di hui thi..
Aik fa bna k us ka compliment bhi bnana tha.
Aik expration dia hua tha us ka TG bnana tha.
Aik expression dia hua tha us sy CFG bnana tha.
Aik CFG given tha us sy 5 string drive krny thy.
Decidable problem ko define krna tha with example...❤❤

[15/02, 1:40 pm] +92 323 4134266: Aj mera cs402 ka paper tha
Mcqs mostly past papers se thy or quiz no 4 se thy
Aik table tha jis se mealy machine bnani thi 5 marks ka
Outputs likhni thi Aik question ma Uski diagram di hoi thi
Strings di hoi thi us se NFA bnana tha or bhi thy last Waly lectures ma se
Transition graph bnana tha
Bs mujhe itna he yad ha 😇

[15/02, 1:40 pm] +92 323 4134266: cs402 ka paper tha
Mcqs mostly past papers se thy or quiz no 4 se thy
Aik table tha jis se mealy machine bnani thi 5 marks ka
Outputs likhni thi Aik question ma Uski diagram di hoi thi
Strings di hoi thi us se NFA bnana tha or bhi thy last Waly lectures ma se
Transition graph bnana tha
Bs mujhe itna he yad ha 😇