384 search results - page 39 / 77 » Equivalence Relations on Classes of Computable Structures |
VMCAI
2012
Springer
12 years 3 months ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
SBBD
2004
13 years 9 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
CSR
2008
Springer
13 years 7 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
ENTCS
2008
13 years 7 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...