-----BEGIN PGP SIGNED MESSAGE----- Date: Wed, 18 May 94 12:46:46 CDT From: m5@vail.tivoli.com (Mike McNally) While we're being picky, I'll point out that (unless I'm wrong of course) it's not really an NFA, but a non-deterministic Turing machine (an "NTM"?) that's the automaton at issue here. No, NFA is acceptable and correct, it's Non-determinisic Finite Automaton. A non-deterministic Turing machine is a perfectly reasonable example, however. Rick -----BEGIN PGP SIGNATURE----- Version: 2.3a iQCVAgUBLdpWthaZNKPPNj41AQEttwQAnCs9sZ+fV9BhCMf/PXyM6w59NjIc8ZwF vVL394XfzqvQKUzwK8pV04d5YMusfgbVibj+IuEaAEkn9qMYkaoX9XL65tzhPf8N 6bilBkRVIuCmLye9J0vpylouqS7bAakF7Htu06EDOzTQArBXEWUaBGkaH5P+m8xu xQLMS1RmmKk= =H5dW -----END PGP SIGNATURE-----