A sentence is thought to be a string of words. Some of the consecutive or successive substrings of the sentence could be regarded as a Markov chain. We call such a substring a Markov string. This paper gives a grammatical framework for context-free languages with the Markov strings and presents a recognition algorithm for the languages.
展开▼
