 |
deterministic computation
| English Wikipedia - The Free Encyclopedia | Download this dictionary |
Deterministic automaton
In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is determined by the input.
| See more at Wikipedia.org... |
© This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License
