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 Statement:

 

Consider a Language L having Σ = {a, b}, where;

 

Two a’s are followed by one b or Two b’s are followed by one a

 

You have to provide:

 

a – Regular Expression expressing language described above

b – Finite Automata for RE in part a

c – Transition Table for FA in part b

 

[Marks: 5 + 5 + 5 = 15]

 

Kindly discuss here about this assignment as it will help all the members to solve the assignment.

+ 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: 11048

.

+ 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

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.

State transition table

In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state and other inputs. A state table is essentially a truth table in which some of the inputs are the current state, and the outputs include the next state, along with other outputs.

any help

Assume {a, b, c}

Two a's followed by one b means, (it is two a's not double a)

b follow two a's , which means first minimum two a's then minimum one b

Example

aab, aabb, aacb, aabc, aaacb, aaccbb, aaaaab, (DIFFICULT caab)

aa(a+b)*b+bb(a+b)*a is good combination.

sir,main ne sb comments read kiay hain but mera mind clear ni hua plz about the assignment help me

a- Regular Expression

aa(a+b)*b+bb(a+b)*a I think , what you think

wasy sir ny yeh tu nahi kaha start aa and end b start bb and end a 

aa(a+b)*b+bb(a+b)*a 

 

ap ny  vuwasim?????



in assignment there are two parts and three questions

in first part starting from double a and ending on single b

in second part starting from double b and ending on single a

in first question writer regular expression 

in 2nd Finite Automata for part a mean starting from aa and ending on b

in 3rd question Transition Table for FA in part b mean starting from double b and ending on single a

what u say m i right???

yeah I_S

The statment is "Two a’s are followed by one b" Not Two a’s are following one b
... so the 

R.E must be baa NOT aab 


could you plzz snd me the solution of cs402 1st assignment m new and i didn,t understand it 

plzzz anyone can send me the solution i need it urgent aj last date he mene buhat try ki but mjhy khak smjh ni aya

1)aa(a+b)*b+bb(a+b)*a

2)aa(a+b)*b

3) 

RSS

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

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

.