Unable to understand the theorem, for NFA to DFA conversion, in context of actual conversion, in gfg site.
by ajiten from LinuxQuestions.org on (#6FPNN)
Regarding the conversion of NFA to DFA, am unable to draw a link to a statement in theorem 1.2.2, in the book titled: Formal Models Of Computation, by Arthur Fleck; to the method shown in the site by gfg here, named hereafter as just: gfg.
In face of difficulty of expressing in exact symbols used in the theorem (If there is feature to express the symbols used in the theorem, then please tell.), am attaching a screenshot, of the actual issue faced.
There is second screenshot of the book, accessed via Perlego.
The crux is that the gfg site, considers the start state (s0) alone in deriving the new states, in the DFA transition table.
Does the book's theorem 1.2.2, anywhere implies that need to derive new states, only starting from the initial state (s0)?
Attached Thumbnails
In face of difficulty of expressing in exact symbols used in the theorem (If there is feature to express the symbols used in the theorem, then please tell.), am attaching a screenshot, of the actual issue faced.
There is second screenshot of the book, accessed via Perlego.
The crux is that the gfg site, considers the start state (s0) alone in deriving the new states, in the DFA transition table.
Does the book's theorem 1.2.2, anywhere implies that need to derive new states, only starting from the initial state (s0)?
Attached Thumbnails