We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ 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.
Dear students,
Please note that Quiz-4 will be launched on March 2, 2015 and will include lectures No. 35 to 41.
QUIZ will last for 48 hours only and no alternate/offline will be provided once it is missed.
For any query, feel free to email at cs402@vu.edu.pk
Best Of Luck ....!!
Tags:
+ 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?.
+ 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)Identify the FALSE statement about following CFG: S -> SB|AB A -> CC B -> b C -> a
just 1 mint remainig
CFG generates NULL string
CFG is not in CNF
CFG has 8 Nonterminals
All of the given options
Between the two consecutive joints on a path
One character can be pushed and one character can be popped
Any no. of characters can be pushed and one character can be popped
One character can be pushed and any no. of characters can be popped
Any no. of characters can be pushed and any no. of characters can be popped
In new format of FA (discussed in lecture 37), This state is like initial state of an FA
ACCEPT
REJECT
START
READ
Consider the following CFG: (NOTE: ^ means NULL) S->a|Xb|aYa X->Y|^ Y->b|X Which Nonterminals are nullable
S and X
X and Y
Y and S
S,X and Y
which path sequence follows the rules of "conversion form" of "PDA"
READ -> POP -> POP
POP -> POP -> POP
READ -> POP -> PUSH a
In the null production N --> ^, N is a
Terminal
Non terminal
Word
Semi word
Consider the Following CFG: (NOTE: ^ means NULL) S->Xa X->aX|bX|^ above given CFG can be represented by RE
A*B*
a*b*a
(a+b)*a
a(a+b)*a
Before the CFG corresponding to the given PDA is determined, the PDA is converted into the standard form which is called.
Finite Automaton
Chomsky Normal Form (CNF)
Conversion form
none of given
Tape and Stack alphabets
are same
may be different
must be different
must be same
thank you nayab sis
S
CFG no 2 only
4th
2nd
© 2019 Created by + M.Tariq Malik.
Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
VU Students reserves the right to delete profile, which does not show any Activity at site nor has not activity more than 01 month.
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post