Exercises for the Week 11 part 2 lecture video

• Does this DFSA accept the empty string?
  • show/hideYes, because \( \delta^*( q_0, \lambda ) = q_0 \) and \( q_0 \) is an accepting state.
• For \( \Sigma = \{ 0, 1 \} \), draw a DFSA that accepts the language \( \Sigma^* \).
  • show/hide
• Draw a DFSA for the alphabet \( \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 \( \Sigma = \{ 0, 1 \} \) that accepts exactly those strings that don't contain 00.
  • show/hide