@article{Kotek:2012aa,
    Abstract = {Using a theorem of N. Chomsky and M. Sch{\"u}tzenberger 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 P-recursive (holonomic) sequences in terms of counting certain lattice paths.},
    Author = {Kotek, Tomer and Makowsky, Johann A.},
    Journal = {Fundamenta Informaticae},
    Number = {1-4},
    Pages = {199--213},
    Publisher = {IOS Press},
    Title = {A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths},
    Volume = {117},
    Year = {2012},
    bdsk-url-1 = {https://doi.org/10.3233/FI-2012-696},
    date-added = {2023-08-26 08:54:17 +0200},
    date-modified = {2023-08-26 08:54:17 +0200},
    doi = {10.3233/FI-2012-696}
}

@article{Kotek:2012aa, Abstract = {Using a theorem of N. Chomsky and M. Sch{\"u}tzenberger 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 P-recursive (holonomic) sequences in terms of counting certain lattice paths.}, Author = {Kotek, Tomer and Makowsky, Johann A.}, Journal = {Fundamenta Informaticae}, Number = {1-4}, Pages = {199--213}, Publisher = {IOS Press}, Title = {A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths}, Volume = {117}, Year = {2012}, bdsk-url-1 = {https://doi.org/10.3233/FI-2012-696}, date-added = {2023-08-26 08:54:17 +0200}, date-modified = {2023-08-26 08:54:17 +0200}, doi = {10.3233/FI-2012-696} }