Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED!nerds-end
From: wyse03br@gmail.com
Newsgroups: comp.compilers
Subject: Re: NFA with non-deterministic outputs
Date: Tue, 9 Sep 2014 14:26:07 -0700 (PDT)
Organization: Compilers Central
Lines: 23
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <14-09-006@comp.compilers>
References: <14-04-004@comp.compilers> <14-04-010@comp.compilers>
NNTP-Posting-Host: news.iecc.com
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
X-Trace: miucha.iecc.com 1410298437 9589 2001:470:1f07:1126:0:676f:7373:6970 (9 Sep 2014 21:33:57 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Tue, 9 Sep 2014 21:33:57 +0000 (UTC)
Keywords: lex
Posted-Date: 09 Sep 2014 17:33:57 EDT
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:1372

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