592 views
0 votes
0 votes

Can we simplify this RegEx - $a^*ba^*b(a+b)^*$

2 Answers

Best answer
1 votes
1 votes

Minimum string accepted by this REX will be 'bb'. To accept string of length we need at least 3 states as you can see below

Hence the DFA can't be minimised further. Given REX is minimal

selected by

Related questions

2 votes
2 votes
1 answer
1
iarnav asked Sep 2, 2017
788 views
Write a regular expression for all strings of 0’s and 1’s in which the total number of 0’s to the left of each 1 is even?I'm getting - 0*+((00)*1(0)*)*is it correct...
1 votes
1 votes
0 answers
2
Mk Utkarsh asked Mar 12, 2018
415 views
please verify the regex
1 votes
1 votes
2 answers
3
pC asked Jul 21, 2016
2,518 views
How to simplify a regular expression ? Please share a useful resource .Show that a+aa+b+bb* equal to $\phi$* (a+b*)
3 votes
3 votes
2 answers
4
Mahesha999 asked Dec 26, 2016
665 views
Consider the regex: $(a+b)^*(a+b+\epsilon)a$Which of the following is equivalent to above?:(a) $(a^*+b^*)^+(aa+ba)$(b) $(\epsilon+a+b^*)^+a$(c) $(a+b)^+(a+b+\epsilon)a$(d...