Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compilers > #1220

Re: NFA with non-deterministic outputs

From Kaz Kylheku <kaz@kylheku.com>
Newsgroups comp.compilers
Subject Re: NFA with non-deterministic outputs
Date 2014-04-14 04:34 +0000
Organization Aioe.org NNTP Server
Message-ID <14-04-013@comp.compilers> (permalink)
References <14-04-004@comp.compilers> <14-04-010@comp.compilers>

Show all headers | View raw

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".

Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

NFA with non-deterministic outputs wyse03br@gmail.com - 2014-04-07 12:17 -0700
  Re: NFA with non-deterministic outputs George Neuner <gneuner2@comcast.net> - 2014-04-08 17:37 -0400
  Re: NFA with non-deterministic outputs federation2005@netzero.com - 2014-04-13 11:51 -0700
    Re: NFA with non-deterministic outputs Kaz Kylheku <kaz@kylheku.com> - 2014-04-14 04:34 +0000
    Re: NFA with non-deterministic outputs wyse03br@gmail.com - 2014-09-09 14:26 -0700
      Re: NFA with non-deterministic outputs federation2005@netzero.com - 2014-10-20 15:18 -0700

csiph-web