Sciweavers

259 search results - page 1 / 52
» The Feasibility of Folk Science
Sort
View
FORMATS
2003
Springer
14 years 19 days ago
Folk Theorems on the Determinization and Minimization of Timed Automata
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...
Stavros Tripakis
ELPUB
2007
ACM
13 years 11 months ago
Feasibility of Open Access Publishing for Journals Funded by the Social Science and Humanities Research Council of Canada
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...
Leslie Chan, Frances Groen, Jean-Claude Gué...
CONCUR
2012
Springer
11 years 9 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
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...
Guy Avni, Orna Kupferman