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

Groups > comp.compilers > #1372

Re: NFA with non-deterministic outputs

Show all headers | View raw

Going back to this topic, tks for the updates. The non-deterministic
FSM seems to be the best approach indeed. Your rex tool seems to be
suited to my needs, but I couldn't find it anywhere either. Do you
suggest anything else?

Rgds

On Sunday, April 13, 2014 3:51:36 PM UTC-3, federat...@netzero.com wrote:
> On Monday, April 7, 2014 2:17:44 PM UTC-5, wyse...@gmail.com wrote:
>
> > I need to model some inter-operating FSMs and due to the lack of
> > details in their specification, modelling them as NFAs seems to be the
> > best approach.
>
> A finite automaton models a regular language -- technically: a rational subset
> of a free monoid X*, where X is the underlying alphabet.
>
> A "finite automaton with outputs" is a finite state *machine*, which models a
> *rational transduction*, which is a rational subset of the product monoid X* x
> Y*, where X and Y are the alphabets respectively for inputs and outputs.
>
> So, no. NFA's are not the appropriate model to use here. Rather, one would use
> a non-deterministic FSM (finite state machine). ...

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