[gecode-users] regular constraint
Christian Schulte
cschulte at kth.se
Tue Jun 5 10:18:29 CEST 2012
The assumption is all over the place.
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of ??
Sent: Tuesday, June 05, 2012 9:55 AM
To: users at gecode.org
Subject: Re: [gecode-users] regular constraint
Thanks for your reply, but what is the "optimizations" in the
implementation, part of code in the file "layered-graph.hpp" ?
Could you help to point out which part in the code that leads NFA not work?
XW.
_____
From: cschulte at kth.se
To: skymaormaor at hotmail.com; users at gecode.org
Subject: RE: [gecode-users] regular constraint
Date: Mon, 4 Jun 2012 10:06:22 +0200
The implementation uses optimizations that only work for DFAs. You just have
been lucky with your particular NFA.
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
<http://www.ict.kth.se/%7Ecschulte/>
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of ??
Sent: Monday, June 04, 2012 8:53 AM
To: users at 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.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20120605/6e687506/attachment.html>
More information about the users
mailing list