{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:57:40Z","timestamp":1794380260019,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642150241","type":"print"},{"value":"9783642150258","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15025-8_21","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T02:52:44Z","timestamp":1281927164000},"page":"444-462","source":"Crossref","is-referenced-by-count":1,"title":["Definability of Combinatorial Functions and Their Linear Recurrence Relations"],"prefix":"10.1007","author":[{"given":"Tomer","family":"Kotek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johann A.","family":"Makowsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/jctb.2000.1952","volume":"79","author":"J. Balogh","year":"2000","unstructured":"Balogh, J., Bollob\u00e1s, B., Weinreich, D.: The speed of hereditary properties of graphs. J. Comb. Theory, Ser. B\u00a079, 131\u2013156 (2000)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Balogh, J., Bollob\u00e1s, B., Weinreich, D.: The penultimate rate of growth for graph properties. EUROCOMB: European Journal of Combinatorics\u00a022 (2001)","DOI":"10.1006\/eujc.2000.0476"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(01)00175-5","volume":"116","author":"J. Balogh","year":"2002","unstructured":"Balogh, J., Bollob\u00e1s, B., Weinreich, D.: Measures on monotone properties of graphs. Discrete Applied Mathematics\u00a0116, 17\u201336 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/aama.2000.0711","volume":"26","author":"E. Barcucci","year":"2001","unstructured":"Barcucci, E., Lungo, A.D., Frosini, A., Rinaldi, S.: A technology for reverse-engineering a combinatorial problem from a rational generating function. Advances in Applied Mathematics\u00a026, 129\u2013153 (2001)","journal-title":"Advances in Applied Mathematics"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1073\/pnas.26.8.491","volume":"26","author":"H. Bateman","year":"1940","unstructured":"Bateman, H.: The polynomial of Mittag-Leffler. Proceedings of the National Academy of Sciences\u00a026, 491\u2013496 (1940)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"21_CR6","unstructured":"Bernardi, O., Noy, M., Welsh, D.: On the growth rate of minor-closed classes of graphs (2007)"},{"key":"21_CR7","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. In: EATCS Monographs on Theoretical Computer Science, vol.\u00a012. Springer, Heidelberg (1988)"},{"key":"21_CR8","unstructured":"Blatter, C., Specker, E.: Le nombre de structures finies d\u2019une th\u2019eorie \u00e0 charact\u00e8re fin. Sciences Math\u00e9matiques, Fonds Nationale de la rechercheScientifique, Bruxelles, pp. 41\u201344 (1981)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-13331-3_32","volume-title":"Logic and Machines: Decision Problems and Complexity","author":"C. Blatter","year":"1984","unstructured":"Blatter, C., Specker, E.: Recurrence relations for the number of labeled structures on a finite set. In: B\u00f6rger, E., Hasenjaeger, G., R\u00f6dding, D. (eds.) Logic and Machines: Decision Problems and Complexity. LNCS, vol.\u00a0171, pp. 43\u201361. Springer, Heidelberg (1984)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Bollobas, B., Thomason, A.: projections of bodies and hereditary properties of hypergraphs. J. London Math. Soc.\u00a027 (1995)","DOI":"10.1112\/blms\/27.5.417"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.: Weak second\u2013order arithmetic and finite automata. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.: The algebraic theory of context free languages. In: Brafford, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)"},{"key":"21_CR13","volume-title":"Perspectives in Mathematical Logic","author":"H. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H., Flum, J.: Finite Model Theory. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1995)"},{"key":"21_CR14","volume-title":"Mathematical Logic. Undergraduate Texts in Mathematics","author":"H. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical Logic. Undergraduate Texts in Mathematics, 2nd edn. Springer, Heidelberg (1994)","edition":"2"},{"key":"21_CR15","volume-title":"Automata, Languages, and Machines, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, Vol. A. Academic Press, London (1974)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P. Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s, P., Frankl, P., R\u00f6dl, V.: The asymptotic enumeration of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin.\u00a02, 113\u2013121 (1986)","journal-title":"Graphs Combin."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0097-3165(03)00075-X","volume":"103","author":"E. Fischer","year":"2003","unstructured":"Fischer, E.: The Specker-Blatter theorem does not hold for quaternary relations. Journal of Combinatorial Theory, Series A\u00a0103, 121\u2013136 (2003)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45071-8_11","volume-title":"Computing and Combinatorics","author":"E. Fischer","year":"2003","unstructured":"Fischer, E., Makowsky, J.: The Specker-Blatter theorem revisited. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 90\u2013101. Springer, Heidelberg (2003)"},{"key":"21_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"21_CR20","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"L. Graham","year":"1994","unstructured":"Graham, L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman Publishing Co., Inc., Boston (1994)"},{"key":"21_CR21","volume-title":"The Art of Computer Programming. Fascicle 4: Generating All Trees\u2013History of Combinatorial Generation (Art of Computer Programming)","author":"D.E. Knuth","year":"2006","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle 4: Generating All Trees\u2013History of Combinatorial Generation (Art of Computer Programming), vol.\u00a04. Addison-Wesley Professional, Reading (2006)"},{"key":"21_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"21_CR23","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, vol.\u00a020. Cambridge University Press, Cambridge (1983)"},{"key":"21_CR24","volume-title":"Chebyshev Polynomials","author":"J.C. Mason","year":"2003","unstructured":"Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials. Chapman & Hall\/CRC, Boca Raton (2003)"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/rsa.3240030104","volume":"3","author":"H. Pr\u00f6mel","year":"1992","unstructured":"Pr\u00f6mel, H., Steger, A.: Excluding induced subgraphs: Quadrilaterals. Random Structures & Algorithms\u00a03, 19\u201331 (1992)","journal-title":"Random Structures & Algorithms"},{"key":"21_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata theoretic aspects of formal power series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata theoretic aspects of formal power series. Springer, Heidelberg (1978)"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1006\/jctb.1994.1027","volume":"61","author":"E. Scheinerman","year":"1994","unstructured":"Scheinerman, E., Zito, J.: On the size of hereditary classes of graphs. J. Comb. Theory, Ser. B\u00a061, 16\u201339 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"21_CR28","series-title":"Cambridge Monographs on Applied and Computational Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546815","volume-title":"Practical Extrapolation Methods, Theory and Applications","author":"A. Sidi","year":"2003","unstructured":"Sidi, A.: Practical Extrapolation Methods, Theory and Applications. Cambridge Monographs on Applied and Computational Mathematics, vol.\u00a010. Cambridge University Press, Cambridge (2003)"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(76)90084-0","volume":"2","author":"M. Soittola","year":"1976","unstructured":"Soittola, M.: Positive rational sequences. Theoretical Computer Science\u00a02, 317\u2013322 (1976)","journal-title":"Theoretical Computer Science"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Specker, E.: Application of logic and combinatorics to enumeration problems. In: B\u00f6rger, E. (ed.): Trends in Theoretical Computer Science. 141\u2013169. Computer Science Press; Reprinted in: Ernst Specker, Selecta, Birkh\u00e4user, pp. 324-350 (1988)","DOI":"10.1007\/978-3-0348-9259-9_29"}],"container-title":["Lecture Notes in Computer Science","Fields of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15025-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:15:59Z","timestamp":1558286159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15025-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150241","9783642150258"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15025-8_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-15025-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}