CS402 Assignment 1 Solution and Discussion

[zaasmi]

Re: CS402 Assignment 1 Solution and Discussion

Please share CS402 Assignment 1 Fall 2020

[zaasmi]

@zaasmi said in CS402 Assignment 1 Solution and Discussion:

Re: CS402 Assignment 1 Solution and Discussion

Please share CS402 Assignment 1 Fall 2020

Theory of Automata (CS402)

Assignment # 01

Fall 2020

Total marks = 20 30th November, 2020

Please carefully read the following instructions before attempting 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 file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.

You should concern 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 and bmp etc will not be accepted.

Topic Covered:

Objective of this assignment is to assess the understanding of students about:

· The concept of languages

· Regular Expressions

· Finite automata.

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 assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

If you people find any mistake or confusion in 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]

Questions No 01 Marks (10)

Construct a FA which recognizes the set of all strings defined over ∑= {0, 1} ending with the suffix ‘10’. Also draw transition table for that language.

Questions No 02 Marks (10)

Identify the language L accepted by the following regular expression abab(a + b)*. Also define the recursive definition of that language.
Which of the following string(s) is/are part of language L defined as above?
baaba
aabaa
abbbab
babaa