Which of the following do we use to form an NFA from a regular expression?
(a) Subset Construction Method
(b) Power Set Construction Method
(c) Thompson Construction Method
(d) Scott Construction Method
I have been asked this question in unit test.
The above asked question is from Equivalence of NFA and DFA topic in portion Finite Automata of Automata Theory