edited by
725 views
0 votes
0 votes

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/0A$

Then $L \cup X= $

  1. ∑*
  2. L
  3. X

Ans given : B. ∑*

They said that X is a language which contains all strings that do not end with 1. But is it so?

Can’t we generate 11 from the grammar?

Please verify.

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
suneetha asked Dec 22, 2018
327 views
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
0 votes
0 votes
1 answer
2
0 votes
0 votes
1 answer
3
suneetha asked Dec 22, 2018
519 views
G1: S-→ aSa| bSb|eG2:S → aaS|bbS| ethe shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
1 votes
1 votes
0 answers
4