Exhibiting non-determinism; involving choices between indistinguishable possibilities.

Non-deterministic bottom-up tree automaton recognize the class of regular tree languages.

Wikipedia foundation.

Look at other dictionaries:

  • 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

  • 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 system (philosophy) — A deterministic system is a conceptual model of the philosophical doctrine of determinism applied to a system for understanding everything that has and will occur in the system, based on the physical outcomes of causality. In a deterministic… …   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 system — In mathematics, a deterministic system is a system in which no randomness is involved in the development of future states of the system.[1] A deterministic model will thus always produce the same output from a given starting condition or initial… …   Wikipedia

  • Deterministic parsing — In natural language processing, deterministic parsing refers to parsing algorithms that do not back up. LR parsers are an example. (This meaning of the words deterministic and non deterministic differs from that used to describe nondeterministic… …   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

  • non-determinism — noun a) Dependence on factors other than initial state and input. Moving from a single processor to a multi processor system often exposes hidden non determinism due to invalid assumptions about scheduling. b) Being non deterministic; involving… …   Wiktionary

  • Non-Uniform Memory Access — (NUMA) is a computer memory design used in Multiprocessing, where the memory access time depends on the memory location relative to a processor. Under NUMA, a processor can access its own local memory faster than non local memory, that is, memory …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.