Register

MadeEasy Test Series 2018: Theory of Computation - Regular Grammer

• edited by
350 views
1 votes
1 votes

What is the correct way to solve questions of this kind where equations like these are given and you are asked to determine what languages do the variables X1 X2 X3.. represent?


https://gateoverflow.in/?qa=blob&qa_blobid=16743747552278299880

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

824
views
1 answers
0 votes
ARUN KUMAR 3 asked Oct 15, 2016
824 views
MadeEasy Test Series: Theory Of Computation - Regular Grammar
The grammer {S--> aA | aB | ε, A--> Ab | ε } is(a) Regular and Linear(b) Regular but not Linear(c) Linear but not Regular(d) Neither Linear nor Regular
User Avatar
537
views
1 answers
0 votes
Snehil01 asked May 27, 2023
537 views
Regular expression Theory of Computation
Answer this
User Avatar
814
views
0 answers
0 votes
MiNiPanda asked Jan 15, 2019
814 views
MadeEasy Test Series 2019: Theory of computation - Grammer
Let L be the language of all strings on [0,1] ending with 1.Let X be the language generated by the grammar G.$S \rightarrow 0S/1A/ \epsilon $A \rightarrow 1S ... end with 1. But is it so?Can't we generate 11 from the grammar?Please verify.
User Avatar
Link Copied!