Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy rate regarding a Markov source are asymptotically equal and lor bounded by the maximum number of phrases in distinct parsing of the sequence. Some connections with source coding theorems are also investigated.
['Shigeaki Kuzuoka', 'Tomohiko Uyematsu']
I am writing a research paper on a idea Relationship among Complexities of Individual Sequences over Countable Alphabet
[{"from": "human", "value": "I am writing a research paper on a idea Relationship among Complexities of Individual Sequences over Countable Alphabet"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy rate regarding a Markov source are asymptotically equal and lor bounded by the maximum number of phrases in distinct parsing of the sequence. Some connections with source coding theorems are also investigated."}]