{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T11:23:08Z","timestamp":1747394588223},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_11","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"90-101","source":"Crossref","is-referenced-by-count":4,"title":["The Specker-Blatter Theorem Revisited"],"prefix":"10.1007","author":[{"given":"E.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Makowsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/aama.2000.0711","volume":"26","author":"E. Barcucci","year":"2001","unstructured":"E. Barcucci, A. Del Lungo, A Forsini, and S Rinaldi. A technology for reverse-engineering a combinatorial problem from a rational generating function. Advances in Applied Mathematics, 26:129\u2013153, 2001.","journal-title":"Advances in Applied Mathematics"},{"key":"11_CR2","unstructured":"J. Berstel and C. Reutenauer. Rational Series and their languages, volume 12 of EATCS Monographs on Theoretical Computer Science. Springer, 1984."},{"key":"11_CR3","unstructured":"C. Blatter and E. Specker. Le nombre de structures finies d\u2019une th\u00e9orie \u00e0 charact\u00e8re fin. Sciences Math\u00e9matiques, Fonds Nationale de la recherche. Scientifique, Bruxelles, pages 41\u201344, 1981."},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-13331-3_32","volume-title":"In Logic and Machines: Decision Problems and Complexity","author":"C. Blatter","year":"1984","unstructured":"C. Blatter and E. Specker. Recurrence relations for the number of labeled structures on a finite set. In E. B\u00f6rger, G. Hasenjaeger, and D. R\u00f6dding, editors, In Logic and Machines: Decision Problems and Complexity, volume 171 of Lecture Notes in Computer Science, pages 43\u201361. Springer, 1984."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second-order theory of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12\u201375, 1990.","journal-title":"Information and Computation"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"H.D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer, 1995.","DOI":"10.1007\/978-3-662-03182-7"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"E. Fischer. The Specker-Blatter theorem does not hold for quaternary relations. Journal of Combinatorial Theory, Series A, 2003. in press.","DOI":"10.1016\/S0097-3165(03)00075-X"},{"key":"11_CR8","unstructured":"E. Fischer and J.A. Makowsky. The Specker-Blatter theorem revisited. in preparation."},{"key":"11_CR9","unstructured":"I. Gessel. Combinatorial proofs of congruences. In D.M. Jackson and S.A. Vanstone, editors, Enumeration and design, pages 157\u2013197. Academic Press, 1984."},{"key":"11_CR10","first-page":"1","volume-title":"Handbook of formal languages, Vol. 3: Beyond words","author":"F. G\u00e9cseg","year":"1997","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages, Vol. 3: Beyond words, pages 1\u201368. Springer Verlag, Berlin, 1997."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"F. Harary and E. Palmer. Graphical Enumeration. Academic Press, 1973.","DOI":"10.1016\/B978-0-12-324245-7.50005-8"},{"key":"11_CR12","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages. and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, 1980."},{"key":"11_CR13","unstructured":"R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of. Mathematics and its Applications. Cambridge University Press, 1983."},{"key":"11_CR14","unstructured":"J.A. Makowsky. Specker\u2019s problem. In E. Gr\u00e4del and C. Hirsch, editors, Problems in Finite Model Theory. THE FMT Homepage, 2000. Last version: June 2000, http:\/\/www-mgi.informatik.rwth-aachen.de\/FMT\/problems.ps."},{"key":"11_CR15","unstructured":"J.A. Makowsky. Algorithmic uses of the Feferman-Vaught theorem. Lecture delivered at the Tarski Centenary Conference, Warsaw, May 2001, paper submitted to APAL in January 2003, special issue of the conference, 2001."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"E. Specker. Application of logic and combinatorics to enumeration problems. In E. B\u00f6rger, editor, Trends in Theoretical Computer Science, pages 141\u2013169. Computer Science Press, 1988. Reprinted in: Ernst Specker, Selecta, Birkh\u00e4user 1990, pp. 324\u2013350.","DOI":"10.1007\/978-3-0348-9259-9_29"},{"key":"11_CR17","unstructured":"H.S. Wilf. generatingfunctionology. Academic Press, 1990."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:22Z","timestamp":1556935762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}