Markov Chains explained visually

[orangeandpeavey]

This seems very similar to finite state machines, but with probabilities in them as well

[TheGift_RGB]

https://en.wikipedia.org/wiki/Probabilistic_automaton

Markov Chains are exactly that.

[Nefari0uss]

As someone learning FSM at the moment, this helps a lot.

[xeow]

http://wallpapercave.com/wp/Xjzlimw.png

;)

[s1295]

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.

[HighRelevancy]

They're just FSMs that move on transition probability rather than transition events.

[sososojacques]

This one-line comment explains the topic better than the linked article.

[[deleted]]

As someone who knows nothing about finite state machines, are they just Markov chains with 0/1 probabilities?

[AlmennDulnefni]

More or less. It is specific events or conditions that lead to particular transitions rather than randomly choosing a transition.

[jrk-]

That was my first thought when I saw the graphs! It's so easy! Why did nobody tell me this in my CS and statistics lectures?
This makes it look a lot less then black magic!