[gecode-users] recognize regular subexpressions

[Christian Schulte]

This has nothing to do with the regular constraint.

 

Christian

 

--

Christian Schulte, KTH, web.it.kth.se/~cschulte/

 

From: Aribi Noureddine [mailto:aribi_noureddine at yahoo.fr] 
Sent: Monday, June 27, 2011 1:46 PM
To: cschulte at kth.se
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 <cschulte at kth.se>
À : 'Aribi Noureddine' <aribi_noureddine at yahoo.fr>; users at gecode.org
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: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Aribi Noureddine
Sent: Monday, June 27, 2011 12:45 PM
To: users at gecode.org
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,

 

 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20110627/88ade144/attachment.htm>