Exercises for the Week 11 part 2 lecture video

• Does this DFSA accept the empty string?
  • show/hideYes, because ${\delta }^{\ast }(q_0,\lambda )=q_0$ and $q_0$ is an accepting state.
• For $\mathrm{\Sigma }=\{0,1\}$, draw a DFSA that accepts the language ${\mathrm{\Sigma }}^{\ast }$.
  • show/hide
• Draw a DFSA for the alphabet $\mathrm{\Sigma }=\{a,b,c\}$ that accepts exactly those strings that are a prefix of "abc".
  • show/hide
• Draw an NFSA with at most four states that accepts the same language
  • show/hide
• Draw a DFSA for the alphabet $\mathrm{\Sigma }=\{0,1\}$ that accepts exactly those strings that don't contain 00.
  • show/hide