- deterministic input
- детерминированный входящий поток
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Deterministic automaton — is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for every occurrence. A common deterministic automaton is a deterministic finite state machine (sometimes… … Wikipedia
Deterministic Parallel Java — OS Cross platform Website http://dpj.cs.uiuc.edu Deterministic Parallel Java (DPJ) is an extension of the Java programming language which adds parallel constructs that provide a deterministic programming model for object oriented languages. The… … Wikipedia
Deterministic jitter — (or DJ) is a type of jitter with a known non Gaussian probability distribution. The other major class of jitter is non deterministic, or random jitter. Characteristics Deterministic jitter is clock timing jitter or data signal jitter that is… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Deterministic algorithm — In computer science, a deterministic algorithm is an algorithm which, in informal terms, behaves predictably. Given a particular input, it will always produce the same output, and the underlying machine will always pass through the same sequence… … Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
Deterministic system (mathematics) — In mathematics, a deterministic system is a system in which no randomness is involved in the development of future states of the system. Deterministic models thus produce the same output for a given starting condition.… … Wikipedia
Deterministic policy — In AI planning and reinforcement learning, a policy prescribes an action given a non empty sequence of states. A deterministic policy will always prescribe the same action, over time,for any given input … Wikipedia
Finite & Deterministic Discrete Event System Specification — FD DEVS (Finite Deterministic Discrete Event System Specification) is a formalism for modeling and analyzing discrete event dynamic systems in both simulation and verification ways. FD DEVS also provides modular and hierarchical modeling features … Wikipedia
Non-deterministic Turing machine — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… … Wikipedia