Text generation using Markov chains.

Fri, 04 Jan 2013 00:00:00 -0800

Introduction
#

If you are already familiar with finite automata, then understanding a Markov chain will not be as hard. If you are not familiar with one, you can think of finite automata as a flowchart, with states and paths leading from one state to another based on some decision being made. An example could be a room with a light switch; there are the two states of having the light on or off. Using the light switch will transition you between the two states.

Markov Chains on Andrew Walsh

Text generation using Markov chains.

Introduction #

Introduction
#