Question

Which of the following statement is true?

(a) Every language that is defined by regular expression can also be defined by finite automata

(b) Every language defined by finite automata can also be defined by regular expression

(c) We can convert regular expressions into finite automata

(d) All of the mentioned

The question was posed to me by my school principal while I was bunking the class.

My enquiry is from Right Left Linear Grammar in division Contextfree Grammar and Syntax Analysis of Compiler

Answer 1

Right option is (d) All of the mentioned

For explanation I would say: All these statements are true w.r.t regular expression.