Home > Term: deterministic finite state machine (DFA)
deterministic finite state machine (DFA)
A finite state machine with at most one transition for each symbol and state.
- Ordklass: noun
- Bransch/domän: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Skapad av
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
