yes, i agree with bigyan..
U can better refer, hopcroft ullman text book (a standard book for automata
theory)
If the Input alphabet do not contain { є }, then
' * ' is known as Closure Operation ==> R* = {є, R, RR, RRR,......}
' + ' is known as Transitive Closure Operation ==> R+ = {R, RR, RRR,
RRRR, ......}
Therefore, R+ = R* - {є}
else
R . R* == R+
i.e for example if input alphabet contains {є, 0, 1}
then R* = (є + 0 + 1)* ==> {є, 0, 1, 00, 01, 10, 11,.......}
R . R* = (є + 0 + 1) . (є + 0 + 1)* ==> {є, 0, 1, 00, 10, 01, 11, .....}
R+ = (є + 0 + 1)+ ==> {є, 0, 1, 00, 01, 10, 11, ....}
therefore R.R* == R+
On 3/29/07, BiGYaN <[EMAIL PROTECTED]> wrote:
>
>
> RR* = R* only when R contains a null string.
>
> else, RR* = R+
>
>
> >
>
--
Uday Kumar Bachu
MTech CS IIT Kharagpur
Phone No.: 09733504604
e-mail: [EMAIL PROTECTED]
--~--~---------~--~----~------------~-------~--~----~
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 email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
