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...
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...
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...