Question

Purpose: Gain experience converting from finite automata to regular expressions.

Give regular expressions generating the following languages over {0,1}. Do these by hand by converting the finite automata. In your answers, you may use the shorthand Σ = (0+1)

a. {w | w does not contain the substring 110}

b. {w | w is any string except 11 and 111}

Answer 1

The above photo will give you the clarity about the finite automate and their conversion from the regular expression to finite automata

a )

Regular expression :

( 0 + 10 )^*1^*

Finite automata :

2 )

Regular expression :

(epsilon + 1) + (0 + 10 + 110 + 1110 + 1111) (0 + 1)^*

Note : in keyboard there is no epsilon symbol. so im mentioning through its name

Finite automata :