I think a regular expression is just too hard, a CFG might be easier . Let
me know if you have a solution for regular expression
On 3/14/07, Ravi <[EMAIL PROTECTED]> wrote:
>
>
> what will be a regular expression(non-UNIXone please) for the set of
> languages which have number of 0s divisible by 5 and number of 1s
> divisible by 2. The set of alphabets is {0,1}.
>
> Please tell how you arrived at the solution.
>
>
> >
>
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
