Question

Which of the following is not a step in elimination of states procedure?

(a) Unifying all the final states into one using e-transitions

(b) Unify single transitions to multi transitions that contains union of input

(c) Remove states until there is only starting and accepting states

(d) Get the resulting regular expression by direct calculation

The question was asked in examination.

Origin of the question is Conversion by Eliminating states in chapter Regular Expressions and Languages of Automata Theory

Answer 1

The correct answer is (b) Unify single transitions to multi transitions that contains union of input

For explanation I would say: While eliminating the states, we unify multiple transitions to one transition that contains union of input and not the vice versa.