OnlineWoerterBuecher.de
Internes

Lexikon


deterministic automaton


A finite-state automaton in which the overall course of the computation is completely determined by the program, the starting state, and the initial inputs. The class of problems solvable by such automata is the class P (see polynomial-time algorithm). (1996-05-03)

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ automata ] [ automaton ] [ b ] [ by ] [ ch ] [ cl ] [ class ] [ co ] [ com ] [ complete ] [ de ] [ du ] [ ed ] [ ee ] [ er ] [ era ] [ et ] [ fi ] [ file ] [ finite ] [ gr ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ input ] [ io ] [ is ] [ it ] [ la ] [ Lex ] [ lv ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ ne ] [ ng ] [ ni ] [ no ] [ np ] [ om ] [ ph ] [ pl ] [ polynomial ] [ polynomial-time ] [ polynomial-time algorithm ] [ pr ] [ program ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ so ] [ st ] [ state ] [ su ] [ T ] [ tar ] [ th ] [ theory ] [ to ] [ va ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2993 Reads)

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

Page Generation in 0.0741 Seconds, with 16 Database-Queries
Zurück zur Startseite