OnlineWoerterBuecher.de
Internes

Lexikon


nondeterministic automaton


(Or "probabilistic automaton") An automaton in which there are several possible actions (outputs and next states) at each state of the computation such that the overall course of the computation is not completely determined by the program, the starting state, and the initial inputs. See also nondeterministic Turing Machine. (1996-05-07)

In addition suitable contents:
[ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ au ] [ automaton ] [ b ] [ ba ] [ bi ] [ by ] [ ch ] [ co ] [ com ] [ complete ] [ de ] [ deterministic ] [ du ] [ ed ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ gr ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ input ] [ io ] [ is ] [ it ] [ Lex ] [ li ] [ list ] [ ls ] [ ly ] [ M ] [ ma ] [ Mac ] [ Mach ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ ne ] [ ng ] [ ni ] [ no ] [ nondeterministic ] [ np ] [ ns ] [ O ] [ om ] [ output ] [ ph ] [ pl ] [ pr ] [ probabilistic ] [ probabilistic automaton ] [ program ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ se ] [ si ] [ so ] [ st ] [ state ] [ su ] [ T ] [ tar ] [ th ] [ theory ] [ to ] [ tp ] [ Turing ] [ Turing Machine ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3247 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1914 Seconds, with 17 Database-Queries
Zurück zur Startseite