How to draw this finite automate? I would like to verify if i have the good approach to this problem, while looking at my solution it seems ok but i am not sure. Thank you.
I am using this tool to draw if you wanna help out : http://madebyevan.com/fsm/
Here's the question  :
Build a finite automata ( it can be deterministic or not) that accept this language on the alphabet $\{0,1\}$ :
$$L=\{w : w \neq 11 \text{ and } w \neq 101  \}$$
In other words, L includes all sequences except 11 and 101
Here's what i tried :
You might benefit from constructing a complete binary tree of depth three (each internal node has one child consuming a &quot;0&quot; and one consuming a &quot;1&quot;), determining which nodes are rejecting, which are accepting, and then simplify the tree.
We want to avoid $11$ and $101$