Question

Find the wrong statement?

(a) The language accepted by finite automata are the languages denoted by regular expression

(b) Every DFA has a regular expression denoting its language

(c) For a regular expression r, there does not exists NDFA with L® ant transit that accept

(d) None of the mentioned

I have been asked this question during a job interview.

My enquiry is from Transformation from NFA to DFA topic in section Finite Automata and Regular Expression of Compiler

Answer 1

Correct option is (c) For a regular expression r, there does not exists NDFA with L® ant transit that accept

To explain I would say: The vice versa is true.