Which is the application of NFA?
(a) A regular language is produced by union of two regular languages
(b) The concatenation of two regular languages is regular
(c) The Kleene closure of a regular language is regular
(d) All of the mentioned
The question was asked in an international level competition.
Origin of the question is Non-Deterministic Finite Automata in chapter Finite Automata and Regular Expression of Compiler