@inbook{KotekMakowsky:2010,
    Abstract = {We consider functions of natural numbers which allow a combinatorial interpretation as counting functions (speed) of classes of relational structures, such as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these functions satisfy a linear recurrence relation over {\$}{\backslash}mathbb Z{\$}or {\$}{\{}{\backslash}mathbb Z{\}}{\\_}m{\$}and allow an interpretation as counting the number of relations satisfying a property expressible in Monadic Second Order Logic (MSOL).},
    Address = {Berlin, Heidelberg},
    Author = {Kotek, Tomer and Makowsky, Johann A.},
    BookTitle = {Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday},
    Editor = {Blass, Andreas and Dershowitz, Nachum and Reisig, Wolfgang},
    File = {Definability of Combinatorial Functions and Their Linear Recurrence Relations - Kotek-Makowsky2010\_Chapter\_DefinabilityOfCombinatorialFun - a - k.pdf},
    ISBN = {978-3-642-15025-8},
    Pages = {444--462},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Definability of Combinatorial Functions and Their Linear Recurrence Relations},
    URL = {https://doi.org/10.1007/978-3-642-15025-8\_21},
    Year = {2010},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-642-15025-8\_21},
    date-added = {2020-10-04 09:57:12 +0200},
    date-modified = {2023-08-23 10:21:03 +0200},
    doi = {10.1007/978-3-642-15025-8_21}
}

@inbook{KotekMakowsky:2010, Abstract = {We consider functions of natural numbers which allow a combinatorial interpretation as counting functions (speed) of classes of relational structures, such as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these functions satisfy a linear recurrence relation over {\$}{\backslash}mathbb Z{\$}or {\$}{{}{\backslash}mathbb Z{}}{\_}m{\$}and allow an interpretation as counting the number of relations satisfying a property expressible in Monadic Second Order Logic (MSOL).}, Address = {Berlin, Heidelberg}, Author = {Kotek, Tomer and Makowsky, Johann A.}, BookTitle = {Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday}, Editor = {Blass, Andreas and Dershowitz, Nachum and Reisig, Wolfgang}, File = {Definability of Combinatorial Functions and Their Linear Recurrence Relations - Kotek-Makowsky2010_Chapter_DefinabilityOfCombinatorialFun - a - k.pdf}, ISBN = {978-3-642-15025-8}, Pages = {444--462}, Publisher = {Springer Berlin Heidelberg}, Title = {Definability of Combinatorial Functions and Their Linear Recurrence Relations}, URL = {https://doi.org/10.1007/978-3-642-15025-8_21}, Year = {2010}, bdsk-url-1 = {https://doi.org/10.1007/978-3-642-15025-8_21}, date-added = {2020-10-04 09:57:12 +0200}, date-modified = {2023-08-23 10:21:03 +0200}, doi = {10.1007/978-3-642-15025-8_21} }