20 search results - page 3 / 4 » Shuffle Decomposition of Regular Languages |
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
EMNLP
2011
12 years 7 months ago
2011
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
DLT
2009
13 years 5 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
CONSTRAINTS
2006
13 years 7 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...