「deterministic」の共起表現(1語右で並び替え)

意味
共起
表現

「deterministic」の共起表現一覧(1語右で並び替え)

deterministic

1語右で並び替え

該当件数:76件

h can then be derandomized and turned into deterministic algorithms.
al and syntactic analyzers (parsers) (both deterministic and non-deterministic) for all kind of con
orian were in writing history that was not deterministic, and in revising the views about fascism.
No combination of local deterministic and local random variables can reproduce t
The linear deterministic approach to nature and technology promoted
automaton of some type and returns another deterministic automaton that recognizes the exact same f
A common deterministic automaton is a deterministic finite state
Deterministic automaton is a concept of automata theory
The resulting process network exhibits deterministic behavior that does not depend on the vario
nts for universal impermanence, continuous deterministic causality, and utilitarianism.
aker's map is an exactly solvable model of deterministic chaos, in that the eigenfunctions and eige
hnique can be used to distinguish between ( deterministic) chaotic and truly random behavior, althou
cal solution would be to use one that uses deterministic complexity models.
In computer science, it is referred to as deterministic computation.
The deterministic context-free grammars are those a determin
In formal grammar theory, the deterministic context-free grammars (DCFGs) are a proper
Deterministic context-free grammars were particularly us
the set of well-formed expressions in some deterministic context-free language.
coupled baker's maps can be used to model deterministic diffusion.
D for degenerate (or deterministic) distribution (constant)
As with many deterministic dynamical systems, the baker's map is stud
These solvers are used to optimize the deterministic equivalent problem and also the subproblem
lems and reformulation of the problem as a deterministic equivalent.
To provide guarantees of deterministic execution time and memory consumption, Ato
me task scheduling and generates code with deterministic execution time and memory consumption, sim
ook; that it puts forward a monocausal and deterministic explanation of the Holocaust, holding it t
it can be accepted by a deterministic finite state machine.
used for the transformation of an NFA to a deterministic finite automaton (DFA).
The standard way to build a deterministic finite state machine from a nondeterminist
t p be the number of states in the minimum deterministic finite automaton Aβ* to recognize language
onstruction is an algorithm to construct a deterministic finite automaton from a given nondetermini
eterministic finite automaton (NFA) into a deterministic finite automaton (DFA).
odes announced a method for decomposing a ( deterministic) finite automaton into "simple" components
An example is a deterministic finite state machine which is a finite sta
or defining instances of automata, such as deterministic finite automata (DFAs), it is required to
science, more precisely, in the theory of deterministic finite automata (DFA), a synchronizing wor
The scanner works as a deterministic finite-state machine.
ssity, which can be caused by a nonrandom, deterministic force such as natural selection."
ple alpha-beta pruning can be used in many deterministic games).
gree of nondeterminism in the grammar - on deterministic grammars the GLR algorithm runs in O(n) ti
o functions; however the SXM is still only deterministic if (at most) one transition is enabled in
body problem is also used to establish the deterministic interpretation of quantum mechanics.
Computer scientist at CMI extended the deterministic isolation technique for reachability in pl
Map all possible states of the deterministic log-space machine to vertices of a graph,
ray Hopper Award in 2005 for discovering a deterministic log-space st-connectivity algorithm, which
Note that this machine will be a deterministic Muller automaton.
He is best known for the deterministic mutation hypothesis explaining the mainten
culty in parsing an ambiguous grammar by a deterministic parser (see deterministic context-free gra
1) proved that the equivalence problem for deterministic PDA (i.e.
A deterministic PDA is a deterministic-finite automaton (D
bute of some stochastic processes and some deterministic processes.
The two are not equivalent for the deterministic pushdown automaton (although they are for
Answers a basic question about deterministic pushdown automata: it is decidable whether
ilizes dedicated bandwidth while providing deterministic Quality of Service (QoS).
s which is dynamically-varying and follows deterministic rules, or is dynamical, to map out how thi
concept, quantum mechanics is a completely deterministic science (compare to the Copenhagen interpr
odel of computation (MoC) where a group of deterministic sequential processes are communicating thr
he algorithm can be simulated in O(log2 n) deterministic space.
g Wang tiles for texture variation, with a deterministic substitution system.
the Congregational church, he rejected its deterministic teachings.
airs (k, n) with small factors, and then a deterministic test, in this case the Lucas-Lehmer-Riesel
s work is therefore more flexible and less deterministic than McLuhan's.
ment of a program is more defined and more deterministic than the original program.
hine into a state in A. (If the machine is deterministic, the possible computations are the prefixe
he British Museum he developed an original deterministic theory of economic development.
-Bohm theory)- a non-local hidden variable deterministic theory whose predictions agree perfectly w
Or can deterministic Turing machines efficiently simulate all p
y a probabilistic Turing machine but not a deterministic Turing machine?
deterministic TWA are closed under complementation (but
This allows a deterministic universe to nevertheless contain responsib
t bounds for the necessary run-time of the deterministic version of the Miller-Rabin primality test
The deterministic version has been used in operational conte
related model, the Geometric Series, is a deterministic version of the Dominance pre-emption model
It assumes a deterministic world-view in which the planets indicate p
The B* algorithm applies to two-player deterministic zero-sum games.