The longest matching consecutive subsequence between two N-ary expansions found applications in information theory and molecular biology. In this paper, we establish an almost sure limit theorem for the longest matching consecutive subsequence, and investigate the size of the set of points violating the limit in terms of Hausdorff dimension.
Funding Agencies|National Natural Science Foundation of China [11671189]; Natural Science Foundation of Fujian Province [2017J01403]