The subset construction shows that every NFA accepts a __________
(a) String
(b) Function
(c) Regular language
(d) Context-free language
The question was posed to me in a job interview.
I need to ask this question from Non-Deterministic Finite Automata in chapter Finite Automata and Regular Expression of Compiler