revision of chapter on finite state machines

Additionally, the conversion of regular expressions to finite state machines
has been simplified: We do not use closures any more.  Rather, the transition
function is now represented as a binary relation.