Like DFAs, NFAs only recognize regular languages.
(a) True
(b) False
I have been asked this question by my college director while I was bunking the class.
I want to ask this question from Non-Deterministic Finite Automata topic in chapter Finite Automata and Regular Expression of Compiler