Jump to content

Deterministic computation

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Canderra (talk | contribs) at 16:46, 2 February 2006 (Added info about DFA's). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In Computer Science a Deterministic Computation is a computation that given an initial state of the system will always produce the same final state when given the same input.

An example of deterministic computation is a deterministic finite state machine (sometimes referred to as a deterministic finite automaton (DFA)) which is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages.

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Deterministic_computation&oldid=37861268"