Question

Which of the following is the corresponding Language to the given DFA?

(a) L= {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}

(b) L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}

(c) L= {x ϵ {0,1} |x ends in 1 and does not contain substring 00}

(d) L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}

I got this question in unit test.

I want to ask this question from DFA Processing Strings in chapter Finite Automata of Automata Theory

Answer 1

The correct option is (b) L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}

To explain: The Language can be anonymously checked and thus the answer can be predicted. The language needs to be accepted by the automata (acceptance state) in order to prove its regularity.