The language accepted by finite automata are the languages denoted by regular expressions

For every DFA there is a regular expression denoting its language

For a regular expression r, there does not existNFA with L(r)any transit that accept

None of these

{a}

{ ∈ , a, b }

{a, b}

{ ab }

{ a, b, ab, aa }

{ a, b, ba, bb }

{ a, b }

{ aa, ab, ba, bb }

a | b

(ab)*

(a | b)*

a*| b

(0 | 1) *

(0 | 1) (0 | 1)*

(00 01 1 10)*

(0 | 1 ) (0 | 1)(0 | 1) *