A Quick Non-Deterministic to Deterministic Finite Automata Conversion
17.6 هزار بار بازدید -
3 سال پیش
-
In this lesson, we convert
In this lesson, we convert a non-deterministic finite automata (NFA) to a deterministic one (DFA). It is assumed that the viewer is at least partially familiar with the differences between these two classifications of finite state machines.
Timestamps
00:17 | Problem definition
01:31 | RegEx to state diagram
02:38 | Diagram to transition table
04:52 | Initializing the set of states for the DFA, Q'
05:51 | Iteratively building the rows of the transition table
11:55 | Identifying accepting states
13:01 | Relabeling the states
14:32 | Creating the DFA state diagram
16:59 | Evaluating our new state machine
Hashtags
#deterministic #finite #automata
Timestamps
00:17 | Problem definition
01:31 | RegEx to state diagram
02:38 | Diagram to transition table
04:52 | Initializing the set of states for the DFA, Q'
05:51 | Iteratively building the rows of the transition table
11:55 | Identifying accepting states
13:01 | Relabeling the states
14:32 | Creating the DFA state diagram
16:59 | Evaluating our new state machine
Hashtags
#deterministic #finite #automata
3 سال پیش
در تاریخ 1400/12/13 منتشر شده
است.
17,666
بـار بازدید شده