Markovian Literary Text Generator (Stochastic Nondeterministic Automaton)

Here we have programmed a Nondeterministic Finite Automaton to replicate various literary works, where our program output is based on stochastic production laws designed according to chain frequencies within any given text file. For the purpose of example our production schematic is used to produce replicas of such stories as To Kill a Mockingbird and multiple Shakespearean plays. The purpose of this write up is then to demonstrate how this automaton was implemented, what possible alterations can be made to achieve other simple computational models, and the possible advantages/disadvantages they may provide in trying to replicate human writing. More specifically it is shown that our Nondeterministic Finite Automaton, based on Markov chain production rules can be interpreted as a context free grammar and can be easily altered into a Context Sensitive Grammar for various applications or improvement in certain areas.

Stochastic Nondeterministic Automaton