476 search results - page 10 / 96 » The Complexity of Equality Constraint Languages |
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
CONSTRAINTS
2008
13 years 7 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
ECOOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
IJCAI
2007
13 years 9 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
FUIN
2010
13 years 5 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...