Which of the following algorithms transforms any NFA into its identical DFA?
(a) Minimal set construction
(b) Dynamic programming
(c) Powerset construction
(d) Huffman coding
I got this question by my school principal while I was bunking the class.
I need to ask this question from Modeling Computations in portion Boolean Algebra and Modeling Computations of Discrete Mathematics