نتایج جستجو برای: deterministic
تعداد نتایج: 46308 فیلتر نتایج به سال:
In this paper, we show that efficient algorithms for some problems Abstract-1 that require limited nondeterminism imply the subexponential simulation of nondeterministic computation by deterministic computation. In particular, if cliques of size O(logn) can be found in polynomial time, then nondeterministic time f(n) is contained in deterministic time 2O( √ f(n) polylog f(n)).
Let L be an infinite regular language on a totally ordered alphabet (Σ, <). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the output alphabet of the automaton. This process generalizes the concept of k-automatic sequence for abstract numeration systems on a regular language (instead of...
Modeling and simulating dynamic systems require to represent their processes and the system changes within one model. To that effect, reconfigurable Petri nets consist of a place/transition net and a set of rules that can modify the Petri net. The application of a rule is based on finding a suitable match of the rule in the given net. This match is an isomorphic subnet that has to be located me...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید