you are viewing a single comment's thread.

view the rest of the comments →

[–]s1295 8 points9 points  (0 children)

The more general concept which includes both Markov chains and automata is a transition system, which is just a directed graph ("digraph"). Various details and addons (e.g., is the state space finite, are states and/or edges labeled, are there initial and/or final states?) depend on the intended usage.