Abstract: Some relationships between two kinds of linear permutation counting problems exist in the set of m level digital sequences of length n whose maximal run length and minimal run length satisfy some constrains respectively.In this paper,some unified formulas are given which solve the above problems.A combinatorial identical relation is also obtained.