科研之友
微信
新浪微博
Facebook
分享链接
摘要
Using a theorem of N. Chomsky and M. Schutzenberger one can characterize sequences of integers which satisfy linear recurrence relations with constant coefficients (C-finite sequences) as differences of two sequences counting words in regular languages. We prove an analog for Precursive (holonomic) sequences in terms of counting certain lattice paths.
- 出版日期2012
