CS402 - Theory of Automata Fall 2020 Solution Assignment No. 1
|
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:
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. |
Question No.1
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.
Solution:
Question No.2
1.
Identify the language L accepted by the following regular
expression a*ba*b(a + b)*. Also define the recursive definition of that
language.
2.
Which of the following string(s) is/are part of language L
defined as above?
1)
baaba
2)
aabaa
3)
abbbab
4)
babaa
Solution:
 |
