Sean H. Breheny wrote:

> ... two common types of theortical state machines: Mealy type and
> Moore type. I can't recall which is which,but for one of the types,
> the output of the machine depends ONLY on the current state.  For the
> other type, it depends on both the current state and the current
> inputs.

  Haven't read this up recently, but it seems to me that these are two
ways of looking at the same thing, reflecting whether the inputs are
separately latched by the state clock.  If so, the (previous) inputs
*become* part of the current state; the next state is actually a set of
states according to the input combinations.

  Diagrammatically, this would have each arrow leading to a set of
states
defined as a primary state and a set of sub-states for the various input
combinations.  Each of these sub-states would then have an exit arrow
(or a state(-set) number).

  Probably a little neater than having states with multiple arrows
exiting and the input denotations on the arrows, but little different in
effect.

  Am I missing something here?  Do I need to get tAoE out of the library
again?  Maybe I should just buy it!
--
  Cheers,
        Paul B.