title: Steps to draw a DFA (or NFA) from a simple statement?
body: <p>I am given a simple statement: Construct a DFA over <code>alphabet {0, 1}</code> that accepts <code>all the strings that end in 101</code>?</p>
  
  <p><strong>My question is that what will be the steps to design it? Or design an NFA, because then I know the clear steps yo convert an NFA to a DFA, so I will then convert the NFA to the DFA.</strong></p>
  
  <p><strong>Note:-</strong> <em>It is just a minor course for me, so I have never studied anything like regular expressions, or any algorithms probably used to construct DFA's.</em></p>