I wrote a paper for my algorithms class summarizing the 3 key techniques for converting deterministic finite automata to regular expressions. I spent quite a bit of time in the last couple of weeks wrapping my head around this problem. If you are interested in reading my paper, maybe you can benefit from what I learned. In particular, you may find the Brzozowski method interesting. Of course, if you are like me, you find great entertainment in just trying to pronouce Brzozowski. My only dissappointment is that I never got a chance to present my paper and say Brzozowski a bunch of times.
You can find the paper here.
Posted by enigma at March 18, 2005 09:56 AM