deterministic fsas. We had a lecture (see my post in the open forum about it) on this topic discussing the algorithm for turning a nondeterministic finite state automaton into a deterministic fsa. I have the cookbook in my text, but it's not laid out as clearly as it could be. I've been googling for some examples, but most of 'em seem to be locked up in pp files (blech). Any good links anyone might have laying around on this?