I have tried below question for designing automata but didn't success:

> 
> The set of strings that consists of either `01` repeated one or more
>  times or `010` repeated one or more times.
> 
> 
> 

where string contains binary characters only . Please read question carefully . Question taken from Automata Theory Language and Computation by john E.Hopcroft chapter 2.

You can use ENFA(Finite automata with Eplison-Transition) . You can give regular expression too .