 The behavior of this automaton on random inputs can be analyzed as a Markov chain, the steady state of which determines the rate at which it finds elements of the common subsequence for large values of "n".This rate is necessarily a lower bound on the Chvátal–Sankoff constant.By using Dančík's method, with an automaton whose state space buffers the most recent "h" characters from its two input strings, and with additional techniques for avoiding the expensive stead-state Markov chain analysis of this approach, was able to perform a computerized analysis with "h" = 15 that proved formula_15.