1805 search results - page 39 / 361 » A Theory of Closure Operators |
108
click to vote
LREC
2008
15 years 5 months ago
2008
This paper is a contribution to formal ontology study. Some entities belong more or less to a class. In particular, some individual entities are attached to classes whereas they d...
148
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
153
click to vote
MSCS
2010
15 years 2 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
136
click to vote
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
155
click to vote
AMC
2005
15 years 3 months ago
2005
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...