Ambiguous parses; decidability of language equivalence
Phonetic rules say things like: if the last two phonemes were x and then y you cannot then have a z next; you cannot begin a word with an x; you cannot end it with a y; everything else is OK. Show that the set of permitted strings forms a regular language.
Must cover Arden's rule
What is the unit for concatenation? (The language consisting of the empty string.)
A program for Kleene's theorem would be an acceptable piece of coursework.
Next: 0.2 Introduction