yes, jand is correct. To clear up the confusion, there are two methods: transitions() (with an s) is the getter/setter for the transitions table, and transition() (no s) picks an Emitter from the transitions table and returns it.

I'm going to go back and just store these things in an array, rather than in a hash.

As for the Markov model - I'm using this code to generate a sequence of states + emissions. So the algorithm is

emit a value->transition to the next state->
if current state isn't the end state then repeat.
[download]

Of course, the next step is to write the code that goes back and tries to figure out what the hidden states were based solely on the emissions.