Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the alphabet∑ ={0,1} , the nul...
Start Learning for Free
Consider the alphabet ∑ = {0,1} , the null/empty string λ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2 are related as follows.
Which one of the following choices precisely represents the strings in X0?
- a)10(0*+(10)*)1
- b)10(0*+(10)*)*1
- c)1(0+10)*1
- d)10(0+10)*1 +110(0+10)*1
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider the alphabet∑ ={0,1} , the null/empty stringλ and ...
Here we have little different version of Arden's Theorem
if we have R= PR + Q then it has a solution R = P*Q
Proof : R= PR+ Q
= P(PR+Q)+Q (by putting R= PR+Q)
= P(PR+Q)+Q (by putting R= PR+Q)
= PPR+PQ+Q
=PP(PR+Q)+PQ+Q (by putting R= PR+Q)
= PPPR+PPQ+PQ+Q
and so on , we get R
= {..........+PPPPQ+PPPQ+PPQ+PQ+Q} = {..........+PPPP+PPP+PP+P+ ^}Q = P*Q
or Another way R=PR+Q
= P(P*Q) + Q (by putting R = P*Q)
=(PP* + ^)Q = P*Q
So Equation is Proved .
Now for the Above Question
X1= 0X1 + 1 X2 (Equation 2)
= 0X1 +1(0X1 + ^) ( Put the value of X2 from Equation 3 )
=0X1 +10 X1+ 1 = (0+10)X1 +1
X1= (0+10)*1 (Apply if R = PR + Q then R = P*Q)
X0 = 1 X1 ( Equation 1)
X0 = 1(0+10)*1 ( Put the value of X1 we calculated).
So 1(0+10)*1 option C is correct.
So 1(0+10)*1 option C is correct.
Most Upvoted Answer
Consider the alphabet∑ ={0,1} , the null/empty stringλ and ...
Here we have little different version of Arden's Theorem
if we have R= PR + Q then it has a solution R = P*Q
Proof : R= PR+ Q
= P(PR+Q)+Q (by putting R= PR+Q)
= P(PR+Q)+Q (by putting R= PR+Q)
= PPR+PQ+Q
=PP(PR+Q)+PQ+Q (by putting R= PR+Q)
= PPPR+PPQ+PQ+Q
and so on , we get R
= {..........+PPPPQ+PPPQ+PPQ+PQ+Q} = {..........+PPPP+PPP+PP+P+ ^}Q = P*Q
or Another way R=PR+Q
= P(P*Q) + Q (by putting R = P*Q)
=(PP* + ^)Q = P*Q
So Equation is Proved .
Now for the Above Question
X1= 0X1 + 1 X2 (Equation 2)
= 0X1 +1(0X1 + ^) ( Put the value of X2 from Equation 3 )
=0X1 +10 X1+ 1 = (0+10)X1 +1
X1= (0+10)*1 (Apply if R = PR + Q then R = P*Q)
X0 = 1 X1 ( Equation 1)
X0 = 1(0+10)*1 ( Put the value of X1 we calculated).
So 1(0+10)*1 option C is correct.
So 1(0+10)*1 option C is correct.
Free Test
FREE
| Start Free Test |
Community Answer
Consider the alphabet∑ ={0,1} , the null/empty stringλ and ...
Here we have little different version of Arden's Theorem
if we have R= PR + Q then it has a solution R = P*Q
Proof : R= PR+ Q
= P(PR+Q)+Q (by putting R= PR+Q)
= P(PR+Q)+Q (by putting R= PR+Q)
= PPR+PQ+Q
=PP(PR+Q)+PQ+Q (by putting R= PR+Q)
= PPPR+PPQ+PQ+Q
and so on , we get R
= {..........+PPPPQ+PPPQ+PPQ+PQ+Q} = {..........+PPPP+PPP+PP+P+ ^}Q = P*Q
or Another way R=PR+Q
= P(P*Q) + Q (by putting R = P*Q)
=(PP* + ^)Q = P*Q
So Equation is Proved .
Now for the Above Question
X1= 0X1 + 1 X2 (Equation 2)
= 0X1 +1(0X1 + ^) ( Put the value of X2 from Equation 3 )
=0X1 +10 X1+ 1 = (0+10)X1 +1
X1= (0+10)*1 (Apply if R = PR + Q then R = P*Q)
X0 = 1 X1 ( Equation 1)
X0 = 1(0+10)*1 ( Put the value of X1 we calculated).
So 1(0+10)*1 option C is correct.
So 1(0+10)*1 option C is correct.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer?
Question Description
Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer?.
Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer?.
Solutions for Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider the alphabet∑ ={0,1} , the null/empty stringλ and the set of strings X0,X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0,X1 and X2are related as follows.Which one of the following choices precisely represents the strings in X0?a)10(0*+(10)*)1b)10(0*+(10)*)*1c)1(0+10)*1d)10(0+10)*1 +110(0+10)*1Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup