This has nothing to do with the regular constraint.
Christian -- Christian Schulte, KTH, web.it.kth.se/~cschulte/ From: Aribi Noureddine [mailto:[email protected]] Sent: Monday, June 27, 2011 1:46 PM To: [email protected] Subject: Re : [gecode-users] recognize regular subexpressions Well, Suppose that we have some words to recognize: {aaabcc,aaab,aaabc,aaabb,...}. So, what I am searching for is a DFA that can recognize the sub expression "aaab" and "ignores" the remaining letters. Thank you. _____ De : Christian Schulte <[email protected]> À : 'Aribi Noureddine' <[email protected]>; [email protected] Envoyé le : Lundi 27 Juin 2011 13h11 Objet : RE: [gecode-users] recognize regular subexpressions Hi, Sorry but I do not understand the question. Could you please elaborate? Christian -- Christian Schulte, KTH, web.it.kth.se/~cschulte/ From: [email protected] [mailto:[email protected]] On Behalf Of Aribi Noureddine Sent: Monday, June 27, 2011 12:45 PM To: [email protected] Subject: [gecode-users] recognize regular subexpressions Hi, Can someone tell me how to recognize regular sub expressions? (using regular constraint) For example, searching for a*b in a*bc* Thank you in advance,
_______________________________________________ Gecode users mailing list [email protected] https://www.gecode.org/mailman/listinfo/gecode-users
