- nondeterministic
-
Exhibiting nondeterminism; involving choices between indistinguishable possibilities.
Nondeterministic bottom-up tree automaton recognize the class of regular tree languages.
Wikipedia foundation.
nondeterministic
Look at other dictionaries:
Nondeterministic algorithm — In computer science, a nondeterministic algorithm is an algorithm that can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A… … Wikipedia
Nondeterministic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
nondeterministic — adj. * * * … Universalium
nondeterministic — non de•ter min•is′tic adj … From formal English to slang
nondeterministic — adj … Useful english dictionary
Nondeterministic finite state machine/Proofs — Theorem For every NFA, there exists an equivalent DFA Let M = (S,, Sigma ,, T,, s {0},, A) be an NFA that recognizes some language , L:Construct a DFA M = (S ,, Sigma ,, T ,, s {0} ,, A ) defined as follows::, S = P(S):, Sigma = Sigma:, T : S… … Wikipedia
nondeterministic network — A network in which the access delay cannot be predicted with certainty, because it is based on a probability function. Also called stochastic network … IT glossary of terms, acronyms and abbreviations
Generalized nondeterministic finite state machine — In the theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA) is a NFA where each transition may be labeled with any regular expression. The GNFA reads blocks of symbols… … Wikipedia
