We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Question No 1:                                                                                                                                  Marks: 5

 

Let L be the language of strings defined over Σ= {0, 1} having odd no. of 1’s.Now Find Distinguishable and Indistinguishable strings by taking z as “1” belonging to Σ*.

 

x

y

Distinguishable/Indistinguishable

11000

10000

 

00000

11111

 

10010

00110

 

10011

10000

 

00111

10111

 

 

 

 

 

 

Question No 2:

                                                                                                                                                            Marks:10

Convert the following Moore machine to an equivalent Mealy machine:

 

a)      Construct transition table for Mealy machine.

b)      Run the string “babaaba” on both machines and find the output.

                                     

Question No 3:

                                                                                                                                                            Marks:5

Using De-Morgan’s law determine an FA corresponding to  FA1∩FA2

 

FA1:

FA2:

                    

.               

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 237

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

ans of q1
x y Distinguishable/Indistinguishable
11000 10000 distinguishable
00000 11111 distinguishable
10010 00110 indistinguishable
10011 10000 indistinguishable
00111 10111 distinguishable

please mention if any mistake is there with reason
It is perfect.... dear ... keep it up
q2
part(a)
It is not possible to construct transition table for mealy machine.



q3
transition table

old states new states
a b
z1 - ≡(x0,y0) (x1,y0)≡z4 (x1,y1)≡z5
Z2 ≡(x0,y1) (x1,y2)≡z6 (x1,y1)≡z5
z3 +≡(x0,y2) (x1,y2)≡z6 (x1,y2)≡z6
z4≡(x1,y0) (x0,y0)≡z1 (x0,y1)≡z2
z5≡(x1,y1) (x0,y2≡z3 (x0,y1)≡z2
z6≡(x1,y2) (x0,y2)≡z3 (x0,y2)≡z3

please mention if any one find any mistake
note it we are using De-morgan,s law........
ap ne transition table FA1 intersection FA2 banaya hai..... laken FA1 aur FA2 ka first of all compliment lein.. phir un ka union find krain aur table draw krain.. like as ....FA1 union FA2
likeas
q2
part(a)
It is not possible to construct transition table for mealy machine.



q3
transition table

old states new states
a b
z1 - ≡(x0,y0) (x1,y0)≡z4 (x1,y1)≡z5
Z2+ ≡(x0,y1) (x1,y2)≡z6 (x1,y1)≡z5
z3 ≡(x0,y2) (x1,y2)≡z6 (x1,y2)≡z6
z4+≡(x1,y0) (x0,y0)≡z1 (x0,y1)≡z2
z5+≡(x1,y1) (x0,y2≡z3 (x0,y1)≡z2
z6+≡(x1,y2) (x0,y2)≡z3 (x0,y2)≡z3
phir ap FA3 draw krain aur phir us ka intersection lein.... to wo FA1 intersection FA2 k equal ho ga
for detail see attach file
Attachments:
ap ne acha work kia ...... but kuch mistakes haain .... setting karain
thanks kashif many ese liy he upload kia becoz i know that i have some mistake so i want correction of these. i have use short method for q3 instead of their complemnt and then whole complement and then union i find direct intersection so is it will be right or i have too use the same one which u mention.plz do tell me
for detailed see example in handouts of cs402........ Use De-morgan's law only not short method .... but solve with short metnod to compare both metnods you see both aresults are equal.......
kashif bhai q2 part a kion nhi ban sakti?
mery kheyal me to ban sakti hy
Old States New states
a output B output
Q0 Q2 1 Q1 0
Q1 Q2 1 Q3 0
Q2 Q3 0 Q2 1
Q3 Q3 0 Q3 1
ap kya kehty ho?
it is not possible... to constract transition table for mealy machine .... for detailed see Mealy machine in handout.......
Kindly send me a proper solution of assignment 4 of cs402 now.I can`t find it anywhere plz help me I am very worried about it. thanks
Solution upload nai kia jata...... discuss kr lein ....... aur khud se banay ki try krain.....
Answer


x y Distinguishable/Indistinguishable
11000 10000 distinguishable
00000 11111 distinguishable
10010 00110 indistinguishable
10011 10000 indistinguishable
00111 10111 distinguishable



Using De-Morgan’s law determine an FA corresponding to FA1∩FA2 FA1: FA2:

We know that if we take complement of so we can write as that is equal to . Because we know that .

Now required FA of can be determined by . According to complement rule, converting the final states to non-final states and old-non-final states to final states, in this way we get follow FA that is equivalent to

RSS

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.