cs402 assignment 1(graded) spring 2015

[saira]

Theory of Automata (CS402)

Assignment # 1(Graded)

  Total marks = 20

                                                                                  Deadline Date = May 21, 2015

 

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.

 

1)      You should concern the recommended books to clarify your concepts as handouts are not sufficient.

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.

 

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.

 

For any query, feel free to email at:

[e-mail]

Q.1. Write Regular Expressions (RE) for the following languages:

1. The language of all strings defined over Σ = {U, V, W} that begins with V, ends with U and having minimum length of 3.
2. The language of all strings defined over Σ = {U, V, W} with V as the third letter and W being the second last letter.                                                                                                                                      

 [Marks 4+4]

Q.2. Draw Finite Automata (FA) for the languages in Q.1                                                  

[Marks 6+6]

 

 

Best of luck!

 

 

[shiningstar]

Q.1. Write Regular Expressions (RE) for the following languages:

1. The language of all strings defined over Σ = {U, V, W} that begins with V, ends with U and having minimum length of 3

solution: v(u+w+v)*u

[shiningstar]

if any mistake mention plz...... and plz share ur ideas :)

[saira]

sir nain kaha hy ky minimum length 3 hony chaiye

is ka kiya matlab , kasay length 3 hoge ???

[saira]

plzzzzzzzzz koye is questions ko discus karay

[Shining Star]

v(u+w+v)*u

is not right solution...

bcz in this language minimum length could be VU (2) bcz 

v(NULL)U is also a word in this language

[Niaz Ali- MCS]

what is right answer

[Shainto]

(y)

[Shining Star]

and also wrong FA 

bcz NULL is a word in this FA

[+ βιит-є-Aȿɨƒ]

it's wrong shiningstar  

you should use + sign instead of * ....

and the FA also not correct 

the FA shared by Badsha bro is correct ...

[+ βιит-є-Aȿɨƒ]

very easy assignment 

Good try students carry on i will help all of you 

Q1:

RE will be .... 

v(u+w+v)⁺u

now solve the 2nd part ... 

[Shining Star]

Wrong answer

in this language the shortest word is "u" which is not the answer

[+ βιит-є-Aȿɨƒ]

what you said explain it bro 

it's 100% right answer 

RE starts with V and ends on U this requirement is clearly mention and the second requirement is the length of string 

now recall the concept of + sign with the RE 

by using * we can write all the possible strings including Null 

and by using + we can write all the possible strings except Null 

how you said that is wrong ???

i think you should clear your concepts ....