From owner-freebsd-hackers Wed Feb 5 20:50:39 1997 Return-Path: Received: (from root@localhost) by freefall.freebsd.org (8.8.5/8.8.5) id UAA06426 for hackers-outgoing; Wed, 5 Feb 1997 20:50:39 -0800 (PST) Received: from dg-rtp.dg.com (dg-rtp.rtp.dg.com [128.222.1.2]) by freefall.freebsd.org (8.8.5/8.8.5) with SMTP id UAA06411 for ; Wed, 5 Feb 1997 20:50:35 -0800 (PST) Received: by dg-rtp.dg.com (5.4R3.10/dg-rtp-v02) id AA29733; Wed, 5 Feb 1997 23:50:04 -0500 Received: from lambert.org by dg-rtp.dg.com.rtp.dg.com; Wed, 5 Feb 1997 23:50 EST Received: from dg-rtp.UUCP (uucp@localhost) by ponds.water.net (8.8.3/8.7.3) with UUCP id XAA01678 for freebsd.org!freebsd-hackers; Wed, 5 Feb 1997 23:23:36 -0500 (EST) Received: from reggae.ncren.net by dg-rtp.dg.com (5.4R3.10/dg-rtp-v02) id AA10021; Wed, 5 Feb 1997 21:30:43 -0500 Received: from mcnc.UUCP by reggae.ncren.net (5.65/tas-reggae/may94) id AA11827; Wed, 5 Feb 97 21:30:04 -0500 Received: from ncnoc.ncren.net by reggae.ncren.net (5.65/tas-reggae/may94) id AA11576; Wed, 5 Feb 97 21:06:19 -0500 Received: from stingray.mcnc.org (stingray.mcnc.org [128.109.130.74]) by ncnoc.ncren.net (8.7.4/8.7.3) with ESMTP id VAA02664; Wed, 5 Feb 1997 21:05:56 -0500 (EST) Received: from relay3.UU.NET by stingray.mcnc.org (8.8.4/MCNC/CIS - 1.0 - 012297) id VAA17127; Wed, 5 Feb 1997 21:03:19 -0500 (EST) Received: from phaeton.artisoft.com by relay3.UU.NET with SMTP (peer crosschecked as: phaeton.Artisoft.COM [198.17.250.211]) id QQcbqu25522; Wed, 5 Feb 1997 21:05:48 -0500 (EST) Received: (from terry@localhost) by phaeton.artisoft.com (8.6.11/8.6.9) id TAA16316; Wed, 5 Feb 1997 19:01:10 -0700 Posted-Date: Wed, 5 Feb 1997 21:03:19 -0500 (EST) From: Terry Lambert Message-Id: <199702060201.TAA16316@phaeton.artisoft.com> Subject: Re: [Fwd: freebsd performance.] To: ponds!ponds!rivers (Thomas David Rivers) Date: Wed, 5 Feb 1997 19:01:10 -0700 (MST) 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 In-Reply-To: <199702060124.UAA25717@lakes.water.net> from "Thomas David Rivers" at Feb 5, 97 08:24:34 pm X-Mailer: ELM [version 2.4 PL24] Mime-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=US-ASCII Sender: owner-hackers@FreeBSD.ORG X-Loop: FreeBSD.org Precedence: bulk > 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.