534 views

2 Answers

1 votes
1 votes

S->0|1| ε|A

A->0A|1A|00|10|11

This is the regular grammar. From the above idea it is possible to  construct the regular expression.

 ε+0+1+(0+1)* (00+10+11)

edited by
0 votes
0 votes

regular expression is not unique may be something else given in ans but all will generate same lang

Related questions

2 votes
2 votes
1 answer
1
Ayush Upadhyaya asked Mar 10, 2017
1,239 views
Give a regular expression for the language over {0,1}NOT CONTAINING 101 AS SUBSTRING.
0 votes
0 votes
2 answers
2
0 votes
0 votes
2 answers
3
0 votes
0 votes
1 answer
4
Ayush Upadhyaya asked Mar 9, 2017
226 views
Give regular expression for all strings that contain no run of a's greater than two.The input alphabet set consists of {a,b,c)