Tag Archives: probabilistic machines

Reversibility of binary relations, substochastic matrices, and partial functions

After the last post, I decided that the next post should contain images. Next I decided that the time to publish another post has come. Here is an image of an acceptor finite-state machine, parsing the string “nice”. How can … Continue reading

Posted in automata, partial functions | Tagged , | 1 Comment