title: The union of two determinstic finite automata?
body: <p>I'm trying to solve a problem where I have to create a DFA for the union of two languages.</p>
  
  <p>These are: 
  {s is {a, b, c}*| every "a" in s is immediately followed by a "b"} and</p>
  
  <p>{ s is {a, b, c}*| every "c" in s is immediately preceeded by a "b"}</p>
  
  <p>I think I am on the right track, but not sure if it is totally correct. Could someone have a look please?</p>
  
  <p><img src="https://dl.dropboxusercontent.com/content_link/saWQ1lyMlFXiH6kswbLiMbjBTA26yx3kaBGTtM01mmW4kMRGV9tEPfdbJENgd2PV?dl=1" alt=""></p>