Scribd
Upload
12 views

TOA Assignemnt 1 GC

The document provides instructions for an assignment on automata theory. It outlines rules for submitting the assignment and includes two questions to answer regarding regular expressions, finite automata, and languages. Question 1 involves identifying languages from regular expressions, writing regular expressions, and properties of languages. Question 2 involves constructing deterministic finite automata to recognize specific languages.

Uploaded by

kiranwaheed51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views

TOA Assignemnt 1 GC

The document provides instructions for an assignment on automata theory. It outlines rules for submitting the assignment and includes two questions to answer regarding regular expressions, finite automata, and languages. Question 1 involves identifying languages from regular expressions, writing regular expressions, and properties of languages. Question 2 involves constructing deterministic finite automata to recognize specific languages.

Uploaded by

kiranwaheed51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment # 1 Total Marks = 20

Theory of Automata Due Date = 05-06-2023

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

You should consult 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, BMP, etc. will not be accepted.

Question #1 Marks [2+1+2+3+1+1] = 10

i. Identify the language “L” accepted by the following regular expression a*ba*b(a+b)*.
Also define the recursive definition of that language.
ii. Write a R.E for the following language over the alphabet L = {a,b} such that it
accepts all the strings in which the letter “b” is never tripled.
iii. Construct a R.E defining each of the following Language over the alphabet ∑ = {x, y}
a. All words end in 3 consecutive “y”.
b. All words having at least one “x”.
iv. Provide the R.E defined over the ∑ = {0, 1} for the string belonging to the following
language
a. All strings having zeros in multiples of three.
b. All strings that do not start with double zeros.
c. All string starting with zero and having no consecutive ones.
v. Consider the following R.E (a +b +c)*(aa +bb +cc)(a +b +c)*
What will be the minimum length of the string that can be generated by the above
R.E? Also write all the possible minimum length strings.
vi. Consider the following alphabet: ∑ = {w, x, y, z}; how many numbers of strings of
length 4 can be generated from the above alphabet?

Question #2 Marks [2 + 2.5+ 2.5 + 3] = 10

i. Construct a DFA theta start with “xy” & ends with “yx” over the ∑={x,y}
ii. Construct a R.E for the given language defined over ∑ ={a, b, c}; the language
should start with “b” and ends with “a” & “c” occurs only once in a string as a 3rd
letter. Also construct the FA.
iii. Give the regular expression over ∑ ={a,b} for the language all the words having “b”
as a 2nd letter. Also draw the FA of that R.E.
iv. 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.

You might also like