Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!border4.nntp.dca.giganews.com!backlog4.nntp.dca3.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED!nerds-end From: Kaz Kylheku Newsgroups: comp.compilers Subject: Re: NFA with non-deterministic outputs Date: Mon, 14 Apr 2014 04:34:51 +0000 (UTC) Organization: Aioe.org NNTP Server Lines: 7 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <14-04-013@comp.compilers> References: <14-04-004@comp.compilers> <14-04-010@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: miucha.iecc.com 1397527512 96842 2001:470:1f07:1126:0:676f:7373:6970 (15 Apr 2014 02:05:12 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Tue, 15 Apr 2014 02:05:12 +0000 (UTC) Keywords: theory Posted-Date: 14 Apr 2014 22:05:12 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com X-Original-Bytes: 1294 Xref: csiph.com comp.compilers:1220 On 2014-04-13, federation2005@netzero.com wrote: > So, no. NFA's are not the appropriate model to use here. Rather, one would use > a non-deterministic FSM (finite state machine). "FA" stands for "finite automaton", which is a synonym of FSM, "finite state machine". There is no difference between "NFA" and "non-deterministic FSM".