Generating More of My Favorite Aphex Twin Track

There are 9 states: start, 1A, 1E, 2F, 2C, 3A, 4F, 4C, and end, and here are the probabilities for each transition:
start→1A: 50%
start→1E: 50%
1A→2F: 100%
1E→2C: 100%
2F→3A: 100%
2C→3A: 100%
3A→4F: 50%
3A→4C: 50%
4F→end: 100%
4C→end: 100%
With this Markov chain, we can generate phrases by beginning at start and following the transitions until we reach end. If we take every possible path through our Markov chain, we’ll see it’s capable of generating four phrases:
start→1A→2F→3A→4F→end (original phrase one)
start→1A→2F→3A→4C→end (new phrase)
start→1E→2C→3A→4C→end (original phrase two)
start→1E→2C→3A→4F→end (new phrase)

Look at that! Even though there will be more states and transitions, you can go through the exact same process of building and walking a Markov chain to generate phrases both new and original.

Source: medium.com