Aug 10 Seatwork (Midterm exam review)

1
Aug 10 Seatwork(Midterm exam review)

• CS 130

2
From Languages to Models

• Consider the language L consisting of all strings
  over the alphabet l, o, p of words that do not
  contain double os.
• The following are not in the L loop, looooo
  ooooplo, pool
• The following are in L plop, polo, ppl,
  poppollopl
• Construct a DFA that accepts L
• Provide a regular expression that describes L
• Devise a grammar that generates L

3
From Models to Languages

• Provide a characterization of the language
  described by the regular expression( (012) 0
  2 )
• Construct a DFA that accepts the same language
• Provide a characterization of the language
  generated by the grammarS ? xTy yTxT ? zTz
  UU ? Uw ?
• Note how many ws, xs, ys and zs are in the
  string of the language?