22 search results - page 3 / 5 » Prime Decompositions of Regular Languages |
ERSHOV
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
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 ...
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...
DLT
2003
13 years 8 months ago
2003
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
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...