Results 271 to 280 of about 9,637 (317)
Some of the next articles are maybe not open access.
UNAMBIGUOUS SHARED-MEMORY SYSTEMS
International Journal of Foundations of Computer Science, 2010Shared-memory systems appear as a generalization of asynchronous cellular automata. In this paper we relate the partial-order semantics of shared-memory systems to Mazurkiewicz trace languages by means of a new refinement construction. We show that a set of labeled partial orders is recognized by some unambiguous shared-memory system if and only if it
openaire +1 more source
Unambiguous Identification of Obesity Trials
New England Journal of Medicine, 2013To the Editor: Colman et al. (Oct. 25 issue)1 describe trial results underlying approval of two weight-management drugs by the Food and Drug Administration. However, their table included noninformative terms (e.g., “study 1”) without citing publications or ClinicalTrials.gov records. The materials that were referenced2,3 used only acronyms (e.g., BLOOM)
Deborah A, Zarin, Tony, Tse
openaire +2 more sources
Unambiguity in Automata Theory (Dagstuhl Seminar 21452)
Dagstuhl Reports, 2021Thomas Colcombet +2 more
semanticscholar +1 more source
Noûs, 1987
Recently, Allan Gibbard has argued that there is a semantic difference between indicative and subjunctive conditional sentences. His arguments, which derive in part from the work of E.W. Adams (see [1] and [2] for example), are presented in detail in [3].
openaire +1 more source
Recently, Allan Gibbard has argued that there is a semantic difference between indicative and subjunctive conditional sentences. His arguments, which derive in part from the work of E.W. Adams (see [1] and [2] for example), are presented in detail in [3].
openaire +1 more source
EVALUATION OF MODIFIED HIRSCH INDEX ALGORITHMS FOR UNAMBIGUITY
, 2021P. Gerasimenko
semanticscholar +1 more source
2005
A nondeterministic finite automaton with e-transitions(eNFA) accepts a regular language. Among the eNFA accepting a certain language some are more compact than others. This essay treats the problem of how to compactify a given eNFA by reducing the number of transitions.
openaire +1 more source
A nondeterministic finite automaton with e-transitions(eNFA) accepts a regular language. Among the eNFA accepting a certain language some are more compact than others. This essay treats the problem of how to compactify a given eNFA by reducing the number of transitions.
openaire +1 more source
Unambiguous Transition Systems
1997Apart from chapter 8, we have concentrated on objects such as behavioural presentations, event structures and vector and trace languages, whose purpose is to model the set of all possible behaviours of some system. In chapter 8, we gave our first illustration of the use of such objects in providing a descriptive formalism, computation graphs, with a ...
openaire +1 more source