{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:51:44Z","timestamp":1725558704459},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201014"},{"type":"electronic","value":"9783540398134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39813-4_25","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:27:49Z","timestamp":1277839669000},"page":"346-360","source":"Crossref","is-referenced-by-count":5,"title":["Automatic Structures of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/LICS.2001.932518","volume-title":"Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"M. Benedikt","year":"2001","unstructured":"Benedikt, M., Libkin, L., Schwentick, T., Segoufin, L.: A model-theoretic approach to regular string relations. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 431\u2013440. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"25_CR2","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)"},{"key":"25_CR3","first-page":"51","volume-title":"Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000)","author":"A. Blumensath","year":"2000","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 51\u201362. IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"1-2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(99)00151-6","volume":"250","author":"C.M. Campbell","year":"2001","unstructured":"Campbell, C.M., Robertson, E.F., Ru\u0161kuc, N., Thomas, R.M.: Automatic semigroups. Theoretical Computer Science\u00a0250(1-2), 365\u2013391 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"25_CR5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"K. Chandra","year":"1981","unstructured":"Chandra, K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery\u00a028(1), 114\u2013133 (1981)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","volume":"48","author":"K.J. Compton","year":"1990","unstructured":"Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic\u00a048, 1\u201379 (1990)","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR7","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1991","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1991)"},{"key":"25_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word processing in groups","author":"D.B.A. Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word processing in groups. Jones and Bartlett, Boston (1992)"},{"key":"25_CR9","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","volume-title":"The Computational Complexity of Logical Theories","author":"J. Ferrante","year":"1979","unstructured":"Ferrante, J., Rackoff, C.: The Computational Complexity of Logical Theories. Lecture Notes in Mathematics, vol.\u00a0718. Springer, Heidelberg (1979)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/LICS.2002.1029830","volume-title":"Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002)","author":"M. Frick","year":"2002","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pp. 215\u2013224. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"25_CR11","first-page":"105","volume-title":"Logic Colloquium 1981","author":"H. Gaifman","year":"1982","unstructured":"Gaifman, H.: On local and nonlocal properties. In: Stern, J. (ed.) Logic Colloquium 1981, pp. 105\u2013135. North Holland, Amsterdam (1982)"},{"key":"25_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574","volume-title":"Model Theory","author":"W. Hodges","year":"1993","unstructured":"Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(82)90042-1","volume":"19","author":"B.R. Hodgson","year":"1982","unstructured":"Hodgson, B.R.: On direct products of automaton decidable theories. Theoretical Computer Science\u00a019, 331\u2013335 (1982)","journal-title":"Theoretical Computer Science"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1109\/LICS.2002.1029832","volume-title":"Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002)","author":"H. Ishihara","year":"2002","unstructured":"Ishihara, H., Khoussainov, B., Rubin, S.: Some results on automatic structures. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pp. 235\u2013244. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"issue":"4","key":"25_CR16","first-page":"467","volume":"6","author":"B. Khoussainov","year":"2001","unstructured":"Khoussainov, B., Rubin, S.: Graphs with automatic presentations over a unary alphabet. Journal of Automata, Languages and Combinatorics\u00a06(4), 467\u2013480 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic partial orders. In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, LICS 2003 (2003) (to appear)","DOI":"10.1109\/LICS.2003.1210056"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-39813-4_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Is Cantor\u2019s Theorem automatic. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 332\u2013345. Springer, Heidelberg (2003)"},{"key":"25_CR19","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"25_CR20","unstructured":"Silva, P.V., Steinberg, B.: A geometric characterization of automatic monoids. Technical Report CMUP 2000-03, University of Porto (2001)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/800125.804029","volume-title":"Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOCS 1973)","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOCS 1973), pp. 1\u20139. ACM Press, New York (1973)"},{"key":"25_CR22","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39813-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T18:14:44Z","timestamp":1548440084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39813-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201014","9783540398134"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39813-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}