منابع مشابه
Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
Automata over infinite words provide a powerful framework, which we can use to solve various decision problems. However, the automatized reasoning with restricted classes of automata over infinite words is often simpler and more efficient. For instance, weak deterministic Büchi automata, which recognize the ω-regular languages in the Borel class Fσ ∩Gδ, can be handled algorithmically almost as ...
متن کاملFurther Pruning for Efficient Association Rule Discovery
The Apriori algorithm’s frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent itemset approach are infeasible for dense data and the approach is unable to discover infrequent associations. OPUS AR is an efficient algorithm for association rule discovery that does not utilize frequent itemsets and hence ...
متن کامل= 1 / 2 rule in Ω − two body non - leptonic decays
Mirror matter admixtures and isospin breaking in the |∆I| = 1/2 rule in Ω − two body non-leptonic decays Abstract We discuss a description of Ω − two body non-leptonic decays based on possible , albeit tiny, admixtures of mirror matter in ordinary hadrons. The |∆I| = 1/2 rule enhancement is obtained as a result of isospin symmetry and, more importantly, the rather large observed deviations from...
متن کاملTesting for Restricted Stochastic Dominance: Some Further Results
Extensions are presented to the results of Davidson and Duclos (2007), whereby the null hypothesis of restricted stochastic non dominance can be tested by both asymptotic and bootstrap tests, the latter having considerably better properties as regards both size and power. In this paper, the methodology is extended to tests of higherorder stochastic dominance. It is seen that, unlike the first-o...
متن کاملUnifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra
The aim of this paper is to present a unifying concept for Petri nets with restricted occurrence rule, to obtain non-sequential semantics in a systematic way. It is shown that partial algebra is a suitable basis for process construction. Restrictions of the occurrence rule are translated into restrictions of concurrent composition of processes. We illustrate this claim on several well-known exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1971
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-23-1-1-3