259 search results - page 1 / 52 » The Feasibility of Folk Science |
61
Voted
COGSCI
2010
14 years 10 months ago
2010
FORMATS
2003
Springer
15 years 3 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...
ELPUB
2007
ACM
15 years 2 months ago
2007
ACM
This paper reports on the results of a feasibility study on open access publishing for humanities and social sciences journals supported by the Social Sciences and Humanities Rese...
CONCUR
2012
Springer
13 years 1 months ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
ACMSE
2006
ACM
15 years 4 months ago
2006
ACM