The implementation uses optimizations that only work for DFAs. You just have been lucky with your particular NFA.
Christian -- Christian Schulte, <http://www.ict.kth.se/~cschulte/> www.ict.kth.se/~cschulte/ From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of ?? Sent: Monday, June 04, 2012 8:53 AM To: users@gecode.org Subject: [gecode-users] regular constraint Hello, I got a problem about extensional(regular) constraint. The question is whether the input of a regular constraint can be a NFA. In the detailed description file of DFA ( http://www.gecode.org/doc-latest/reference/classGecode_1_1DFA.html ), it is said that "the transitions must be deterministic." Is is true? I applied regular constraint on some NFA constraint, it seems to be able to give the correct result. Thank a lot! XW.
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
