Finite automata and formal languages

Question

Write input set, strings and language for the following

 1) The set of all strings with three consecutive O's over (0,1) .

Answer 1

regular Expression = (0+1)*000(0+1)*

L = {w000w| w belongs to {0,1}*}