Letter Scramble

Below, we've used a dataset of the letters 'C,a,r,t,o,n,s'. The accepting states are a handful of anagrams you can make from these letters, starting with the letter C. The Markov chain shows us the likeliness of transitioning between letters based on these words in the dictionary.

CatCarCartCartonCatsCarsCartsCartons
Finite State Machine
Markov Chain

Challenges

1 / 9

Try typing 'Cat'. What happens?

FSM: -
Markov: -