title: Constructing finite state automata corresponding to regular expressions. Are my solutions correct?
body: <p>I have drawn my answers in paint, are they correct?</p>
  
  <p>(4c) For the alphabet {0, 1} construct ﬁnite state automata corresponding to each of the following regular expressions:</p>
  
  <p>(i) 0</p>
  
  <p><img src="https://sites.google.com/site/rhulcomputerscience/_/rsrc/1335416473183/home/4ci.png" alt="4ci"></p>
  
  <p>(ii) 1 | 0</p>
  
  <p><img src="https://sites.google.com/site/rhulcomputerscience/_/rsrc/1335416485391/home/4cii.png" alt="4cii"></p>
  
  <p>(iii) 0 * (1 | 0)</p>
  
  <p><img src="https://sites.google.com/site/rhulcomputerscience/_/rsrc/1335416534498/home/4ciii.png" alt="4ciii"></p>