219 search results - page 17 / 44 » Combinatorial Complexity of Regular Languages |
120
Voted
PAAMS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
115
Voted
ISMVL
2000
IEEE
15 years 4 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
100
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
91
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
103
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...