221 views
0 votes
0 votes

L={x ∈ (0,1)* | |x|>1 and symbol at position i is same at position i+2}.Generate the grammar for L

1) A -> 0B | ∈

    B -> 1A | ∈

2) S -> A | B | C | D

    A -> 0A | 00

    B -> 1B | 11

    C -> 10C | 10

    D -> 01D | 01

3) A -> 00B | AA

    B -> 11A | ∈

4) none of the above

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
iarnav asked Aug 17, 2017
420 views
What will be the CFG when $w \in \{a,b\}^*$ where w contains at least 3 a's?
0 votes
0 votes
2 answers
2
Pawan Kumar 7 asked Jun 11, 2018
390 views
Can aabbaabbbbbbbbaaaa be generate by (a|b)*.. do we need to consider both a and b in language . we can generate any language with a and b ?
0 votes
0 votes
1 answer
3
Wanted asked Jan 21, 2017
408 views
2 votes
2 votes
5 answers
4