8512 search results - page 109 / 1703 » Computing Theory With Relevance |
SC
1992
ACM
14 years 8 days ago
1992
ACM
EUROPAR
2000
Springer
13 years 12 months ago
2000
Springer
AII
1989
14 years 8 days ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
ENTCS
2008
13 years 8 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
LOGCOM
2008
13 years 8 months ago
2008
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...