2,117 views

2 Answers

2 votes
2 votes
  • Option A :
  • Regular Expression = (a+b)*.
  • Reason: As w and wboth are Nullable.And all the strings generated by them are already present in x.
     
  • Option B :
  • Regular Expression = a(a+b)*a + b(a+b)*b.
  • Reason: As w and wboth can be eat up by x.
     
  • Option C :
  • Regular Expression = a(a+b)*b.
  • Reason: As it represents the strings starting with 'a' and ending with 'b'.
edited by
0 votes
0 votes

According to me,  option A,  B, C are correct as 

The moment x = (0+1)

X can eat up the properties of both wwr and anb

Thus making the language regular

Related questions

2 votes
2 votes
5 answers
1
6 votes
6 votes
1 answer
2
0 votes
0 votes
2 answers
3
4 votes
4 votes
1 answer
4
Garrett McClure asked Oct 9, 2017
1,224 views
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...