edited by
879 views

1 Answer

Best answer
3 votes
3 votes
Try Dividing the Problem and then summing up all the possibilities.(Divide and Conquer)

First Let's write RE for All Bit Strings, with leading bit 1, interpreted as a binary integer, with values more than or equal to 32 (Because it will be 6 or more than 6 bits for all these numbers in binary) =  $1(0+1)(0+1)(0+1)(0+1)(0+1)(0+1)^*\,$

Now the remaining Strings in the language are : One Length, Two Length, Three Length, and Some Four length, and Some five length Strings.  = $1\,+ \, 1(0+1)\,+1(0+1)(0+1)\,+1000\,+1001\,+1010\,+11110\,+11111\,$  (Assuming that "in between 10 and 30" means 10 and 30 Not Included in the Exclusion of Strings from the language)

So, The Desired RE for the language is :

$1\,+ \, 1(0+1)\,+1(0+1)(0+1)\,+1000\,+1001\,+1010\,+11110\,+11111\,+1(0+1)(0+1)(0+1)(0+1)(0+1)(0+1)^*\,$
selected by

Related questions

0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4