On Fri, 18 Jan 2002, Sacha Chua wrote:
> Some friends and I were at McDonald's last night, cramming for the > Theory of Computation midterms we're taking later. We were concentrating > on minimizing a DFA that recognizes a certain regular expression. I did > it the mechanical way and to my surprise I had already gotten the > minimal DFA. Gino, on the other hand, sorta guessed through it. You're never without your notebook, so you could have tried /usr/bin/flex regex.l Then a bit of deciphering the scanner tables should do the trick. Of course you can always use the state minimization algorithm, which is what you should have used in the first place, and which is what is programmed into flex. PMana _ Philippine Linux Users Group. Web site and archives at http://plug.linux.org.ph To leave: send "unsubscribe" in the body to [EMAIL PROTECTED] To subscribe to the Linux Newbies' List: send "subscribe" in the body to [EMAIL PROTECTED]
