Dan Bron wrote:
> Which specifically correlates  ~/\. (&.|.)  with finite state
machines.
> That made me wonder if dyadic  ;:  (finite state machine) could
provide an
> amenable solution.

~/\. can produce results very like one of the "state" columns in
(5;a;b;c)&;:

> I can't come up with anything even close; can anyone else?  Or is a
> "sequential machine" not the same as an FSM?  Is it more akin to a
Turing
> machine (i.e. a version of  ;:  that can be instructed to move
backwards)?

;: seems to conflict with the idea of a general purpose f (such as is
indicated in the subject line).

-- 
Raul

----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to