Re: NFA with non-deterministic outputs

Kaz Kylheku <kaz@kylheku.com>
Mon, 14 Apr 2014 04:34:51 +0000 (UTC)

          From comp.compilers
Related articles
NFA with non-deterministic outputs wyse03br@gmail.com (2014-04-07)
Re: NFA with non-deterministic outputs gneuner2@comcast.net (George Neuner) (2014-04-08)
Re: NFA with non-deterministic outputs federation2005@netzero.com (2014-04-13)
Re: NFA with non-deterministic outputs kaz@kylheku.com (Kaz Kylheku) (2014-04-14)
Re: NFA with non-deterministic outputs wyse03br@gmail.com (2014-09-09)
Re: NFA with non-deterministic outputs federation2005@netzero.com (2014-10-20)
| List of all articles for this month |
From: Kaz Kylheku <kaz@kylheku.com>
Newsgroups: comp.compilers
Date: Mon, 14 Apr 2014 04:34:51 +0000 (UTC)
Organization: Aioe.org NNTP Server
References: 14-04-004 14-04-010
Keywords: theory
Posted-Date: 14 Apr 2014 22:05:12 EDT

On 2014-04-13, federation2005@netzero.com <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".

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.