Register

Generate CFG

412 views
0 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.

Voting & Accepting an answer helps improve the community
← Previous · number of stringsNext → · Self Doubt
← Previous in category · GNF QuestionNext in category → · Self Doubt
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
756
756 views
iarnav asked Aug 17, 2017
756 views
Generate CFG
What will be the CFG when $w \in \{a,b\}^*$ where w contains at least 3 a's?
0 0 votes
2 2 answers
730
730 views
Pawan Kumar 7 asked Jun 11, 2018
730 views
Can aabbaabbbbbbbbaaaa be generate by (a|b)*
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 0 votes
1 1 answer
836
836 views
Wanted asked Jan 21, 2017
836 views
is regular grammar does not generate empty string?
2 2 votes
5 5 answers
3.3k
3.3k views
Desert_Warrior asked Aug 22, 2015
3,326 views
Which one of the following doesn’t generate same language as rest?
(a+b)*a(a+b)*(a+b)*b * a b * a (a + b)*(a + b)* a b* a b*b * a (a + b)* a b*All are generating same language.