홈 > 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.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
