Well... I think a hash function is chosen only once for each run of
the program and not for each time a value is hashed. Thereby you dont
have such issues at all.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
The text books on regular expressions show that:
RR*=R*
What I feel is that
RR*=R(є + R + R^2 + R^3 ... )
=R + R^2 + R^3 + R^4 ...
=R+
=R* - {є}
How come RR*=R* is true?
--~--~-~--~~~---~--~~
You received this message because you are
sorry
RR* = R+ is the valid assumption
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send
Yes...the proof is correct and this is what stone had suggested in his
earlier post.
Consider one red sector in the inner disk in each of the 200
different positions, it will match against exactly 100 sectors in the
outer disk since there are 100 of the red sectors in the outer disk.
Similarly
RR* = R* iff R containts epsilon (empty string).
On Mar 27, 1:00 pm, Shashi Kant [EMAIL PROTECTED] wrote:
which book ??
On 3/27/07, Dhruva Sagar [EMAIL PROTECTED] wrote:
But it is used in books about automata...I am not agreeing to it being a
valid assumption anyways.
RR*=R+ and not R* .follow some standard textbooksothers may have
many typo errors
On 3/27/07, Ravi [EMAIL PROTECTED] wrote:
The text books on regular expressions show that:
RR*=R*
What I feel is that
RR*=R(є + R + R^2 + R^3 ... )
=R + R^2 + R^3 + R^4 ...
=R+
