1209 search results - page 155 / 242 » Universal Algebra and Computer Science |
115
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
112
Voted
FORMATS
2003
Springer
15 years 7 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
117
click to vote
ISCC
2002
IEEE
15 years 7 months ago
2002
IEEE
We present an adaptive system for training and teaching. Our system integrates an adaptive training environment and a cooperative environment for exams both accessible via Interne...
IV
2002
IEEE
15 years 7 months ago
2002
IEEE
from Abstract Data to Naturalistic Visual Structure A. Loizides and M.Slater Department of Computer Science, University College London (UCL), London, UK This paper demonstrates a ...
139
click to vote
COLT
2001
Springer
15 years 7 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...