Date: Wed, 5 Feb 1997 19:01:10 -0700 (MST) From: Terry Lambert <terry@lambert.org> To: ponds!ponds!rivers (Thomas David Rivers) Cc: ponds!uunet.UU.NET!ponds!lakes.water.net!rivers, ponds!uunet.UU.NET!ponds!lambert.org!terry, ponds!uunet.UU.NET!ponds!freebsd.org!freebsd-hackers, ponds!uunet.UU.NET!ponds!xinside.com!patrick Subject: Re: [Fwd: freebsd performance.] Message-ID: <199702060201.TAA16316@phaeton.artisoft.com> In-Reply-To: <199702060124.UAA25717@lakes.water.net> from "Thomas David Rivers" at Feb 5, 97 08:24:34 pm
next in thread | previous in thread | raw e-mail | index | archive | help
> The basic idea for the equivalence proof is that: > > 1) All DFAs are NFAs (of course) > 2) Any NFA can be represented as a DFA where the states of > the DFA tuples of the states of the NFA. [Think about > how you would write an NFA simulator; you'd have N > possible states moving from transition to transition.] > > So, DFA <-> NFA. Cheater... "non-finite" != "infinite" in this definition. BTW: The "machine translation of natural languages" question was asked tongue-in-cheek... I suppose I need to add "8-)"'s. 8-(. Terry Lambert terry@lambert.org --- Any opinions in this posting are my own and not those of my present or previous employers.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199702060201.TAA16316>