Question: Languages. The symbols of a language can be considered to be generated by a Markov process. As a Simple example consider a language consisting of the symbols A, B, and S (space). The space divides the symbol sequence into words. In this language two B's or two S's never occur together. Three A's never occur together. A word never starts with AB or ends with BA. Subject to these restrictions, at any point, the next symbol is equally likely to any of the allowable possibilities.
- Formulate a Markov chain for this language. What are the equilibrium symbol probabilities? (Hint: Let some states represent pairs of symbols.)