{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:04:18Z","timestamp":1725728658511},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_32","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T00:28:12Z","timestamp":1370219292000},"page":"273-283","source":"Crossref","is-referenced-by-count":3,"title":["Structures without Scattered-Automatic Presentation"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kartzow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Schlicht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V., Gr\u00e4del, E., Rubin, S.: Automata-based presentations of infinite structures. In: Esparza, J., Michaux, C., Steinhorn, C. (eds.) Finite and Algorithmic Model Theory, pp. 1\u201376. Cambridge University Press (March 2011)","DOI":"10.1017\/CBO9780511974960.002"},{"key":"32_CR2","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44683-4_21","volume-title":"Mathematical Foundations of Computer Science 2001","author":"V. Bruy\u00e8re","year":"2001","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 236\u2013247. Springer, Heidelberg (2001)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. C.R. Acad. Sci. Paris Ser. I\u00a0339, 5\u201310 (2004)","journal-title":"C.R. Acad. Sci. Paris Ser. I"},{"key":"32_CR5","unstructured":"Finkel, O., Todorcevic, S.: Automatic ordinals. CoRR, abs\/1205.1775 (2012)"},{"key":"32_CR6","unstructured":"Huschenbett, M.: The rank of tree-automatic linear orderings. In: Portier, N., Wilke, T. (eds.) STACS. LIPIcs, vol.\u00a020, pp. 586\u2013597. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-30870-3_37","volume-title":"How the World Computes","author":"A. Kartzow","year":"2012","unstructured":"Kartzow, A., Liu, J., Lohrey, M.: Tree-automatic well-founded trees. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol.\u00a07318, pp. 363\u2013373. Springer, Heidelberg (2012)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Kartzow, A., Schlicht, P.: Structures without scattered-automatic presentation. CoRR, arXiv:1304.0912 (2013)","DOI":"10.1007\/978-3-642-39053-1_32"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.apal.2009.07.012","volume":"161","author":"B. Khoussainov","year":"2009","unstructured":"Khoussainov, B., Minnes, M.: Model-theoretic complexity of automatic structures. Ann. Pure Appl. Logic\u00a0161(3), 416\u2013426 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"32_CR10","first-page":"367","volume-title":"Lecture Notes in Computer Science","author":"Bakhadyr Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: LCC, pp. 367\u2013392 (1994)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. Logical Methods in Computer Science\u00a03(2) (2007)","DOI":"10.2168\/LMCS-3(2:2)2007"},{"issue":"4","key":"32_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/1094622.1094625","volume":"6","author":"B. Khoussainov","year":"2005","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Trans. Comput. Log.\u00a06(4), 675\u2013700 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"32_CR13","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures with transitive relations. Transactions of the American Mathematical Society (2011) (to appear)"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1142\/S0129054105003285","volume":"16","author":"C. Rispal","year":"2005","unstructured":"Rispal, C., Carton, O.: Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci.\u00a016(4), 767\u2013786 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"32_CR15","unstructured":"Rosenstein, J.G.: Linear Ordering. Academic Press (1982)"},{"issue":"5","key":"32_CR16","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.apal.2012.11.007","volume":"164","author":"P. Schlicht","year":"2013","unstructured":"Schlicht, P., Stephan, F.: Automata on ordinals and automaticity of linear orders. Annals of Pure and Applied Logic\u00a0164(5), 523\u2013527 (2013)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T07:49:08Z","timestamp":1563090548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}